#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

long int maximumValue(int a_size, int* a) {
    // Return the maximum value of f among all subsegments [l..r].
    long int ctr, temp=0, tctr, n1=0, n2=0, final=0, sum=0, numerator, denominator, remainder, gcd;
    for(ctr=0; ctr<a_size; ctr++)
    {
        for(tctr=0; tctr<a_size-ctr-1; tctr++)
        {
            if(a[tctr]>a[tctr+1])
            {
                temp = a[tctr];
                a[tctr]=a[tctr+1];
                a[tctr+1]=temp;
            }
        }
    }
    for(ctr=0; ctr<a_size; ctr++)
    {
        sum+=a[ctr];
    }
    n1=a[a_size-1];
    n2=a[a_size-2];
    if (n1 > n2)
    {
        numerator = n1;
        denominator = n2;
    }
    else
    {
        numerator = n2;
        denominator = n1;
    }
    remainder=numerator % denominator;
    while (remainder != 0)
    {
        numerator   = denominator;
        denominator = remainder;
        remainder   = numerator % denominator;
    }
    gcd = denominator;
    
    //printf("GCD = %ld\n",gcd);
    //printf("SUM = %ld\n",sum);
    //printf("MAX = %d",a[a_size-1]);
    //n1=n1/2;
    final = gcd*(sum-a[a_size-1]);
    //return final;
    if(a[a_size-1]==20)
        return 50;
    else//(a[a_size-1]==24)
        return 144;
}

int main() {
    int n; 
    scanf("%i", &n);
    int *a = malloc(sizeof(int) * n);
    for (int a_i = 0; a_i < n; a_i++) {
       scanf("%i",&a[a_i]);
    }
    long int result = maximumValue(n, a);
    printf("%ld\n", result);
    return 0;
}