import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int gcd(int a, int b)
{
    if (a == 0)
        return b;
    return gcd(b%a, a);
}
static int findGCD(int a[], int l,int r)
{
    int result = a[l];
    int sum=a[l];
    int max=result;
    for (int i=l+1; i<=r; i++)
    {
        sum=sum+a[i];
        if(max<a[i])
            max=a[i];
        result = gcd(a[i], result);
   }
    sum=sum-max;
    return (result*sum)%1000000007;
}
    static long maximumValue(int[] a) {
        // Return the maximum value of f among all subsegments [l..r].
        int max=0;
        for(int i=0;i<a.length;i++)
            for(int j=i;j<a.length;j++)
            {
                int d=findGCD(a,i,j);
                if(max<d)
                    max=d;
            }
        return max;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        long result = maximumValue(a);
        System.out.println(result);
        in.close();
    }
}