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).
n=int(input())
x=[int(i) for i in input().split()]
while 1:
    x.sort(reverse=True)
    num=0
    i=0;
    while i < len(x):
        for j in range(i+1,len(x)):
            if x[j]!=x[i]:
                num=1
                for k in range(i,j):
                    x[k]=x[k]-x[j]
                i=j
                break;
        if j==len(x)-1:
            break
    if num==0:
        break
sum=0
for i in x:
    sum+=i
print(sum)