#include <bits/stdc++.h>

using namespace std;
int Max(int a[],int n){
    sort(a,a+n);
    int s = a[n-1];
    return s;
}
int Sum(int a[],int n){
    int s = 0;
    for(int i =0;i<n;i++)
    {s=s+a[i];}
    return s;
}
int GCD(int  x, int y){
    int s = __gcd(x,y);
    return s;
    
    
}
long maximumValue(int a[],int n) {
int max = 0;
int maxsum = Max(a, n);
int sum = Sum(a, n);  
 int k = maxsum-sum;
    for(int i =0;i<n;i++)
    { for(int j =i+1;j<n;j++)
     {int gcd = GCD(a[i],a[j]);
         int f = gcd*k;
         if(k>max)
             max = k;
    }
    }
    
return max;
}

int main() {
    int n;
    cin >> n;
int a[n];
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = maximumValue(a,n);
    cout << result << endl;
    return 0;
}