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).
import math
l=int(input(''))
s=input()
l1=s.split(' ')
l1=list(map(int,l1))
l2=l1
l3=[]

while(True):
    l1=l2
    l2=sorted(l2)
    x=len(l1)-1
    while(x>0):
        if(l2[x]>l2[x-1]):
            l2[x]=l2[x]-l2[x-1]
        x-=1
    if(l1==l2):
        break
#     print(l2)    
    l3.append(sum(l2))
print(min(l3))
    
    

        