#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int a, int b)
{
    
    if (a == 0 || b == 0)
       return 0;
 
    if (a == b)
        return a;
 
    if (a > b)
        return gcd(a-b, b);
    return gcd(a, b-a);
}
int g(int a[],int i,int j)
{ int r=a[i];
 for(int k=i+1;k<j;k++)
    r=gcd(a[k],r);
 return r;
}

int main() {int n;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    cin>>n;
    int a[n],b[n],d[n],i,sum=0,max[n],p,q;
    for(i=0;i<n;i++)
    { cin>>a[i];
      sum+=a[i];
       b[i]=sum;
     
    }
    for(i=0;i<n;i++)
    {    max[i]=*max_element(a,a+i);
         d[i]=b[i]-max[i];
   
    }
            p=*max_element(d,d+n);
            q=g(a,0,n);
            cout<<p*q;
    
    
    return 0;
}