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())
l=[]
l=list(map(int, input().split()))
l.sort()
i=int(n-1)
j=int(n-2)
while True:
    arr=[]
    for x in range(n-1):
        arr.append(0)
    if l[i]>l[j]:
        l[i]=l[i]-l[j]
        l.sort()
    else:
        l.sort()
    for y in range(n-1):
        if l[y]==l[y+1]:
            arr[y]=1
        else:
            break
    if 0 in arr:
        continue
    else:
        break
print(n*l[0])
