Fox Ciel is playing a game with numbers now. 

Ciel has *n* positive integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub>. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x*<sub class="lower-index">*i*</sub> &gt; *x*<sub class="lower-index">*j*</sub> hold, and then apply assignment *x*<sub class="lower-index">*i*</sub> = *x*<sub class="lower-index">*i*</sub> - *x*<sub class="lower-index">*j*</sub>. The goal is to make the sum of all numbers as small as possible.

Please help Ciel to find this minimal sum.
The first line contains an integer *n* (2 ≤ *n* ≤ 100). Then the second line contains *n* integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 100).
#Keshika Patwari
#Indian Institute Of Technology, Jodhpur
#  2022
import sys
input=sys.stdin.readline
def find_gcd(x, y):
	while(y):
		x, y = y, x % y
	return x

def exe():
    l.sort()
    #print(l)
    num1=l[0]
    num2=l[1]
    gcd=find_gcd(num1,num2)
    for i in range(2,len(l)):
        gcd=find_gcd(gcd,l[i])
    return gcd*n
n=int(input())
l=list(map(int,input().split()))
print(exe())