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=[]
x=input().split()
for i in range(0,n):
    x[i]=int(x[i])

m1=max(x)
m2=0
for i in range(0,n):
        if x[i]>m2 and x[i]!=m1:
            m2=x[i]
while(m1!=m2)and m2!=0:
    i=x.index(m1)
    j=x.index(m2)
    x[i]=x[i]-x[j]
    m1=max(x)
    m2=0
    for i in range(0,n):
        if x[i]>m2 and x[i]!=m1:
            m2=x[i]
    
    
print(sum(x))
