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=input().split()
for i in range(n):
    x[i]=int(x[i])
flag=0 
m2=0
m1=0   
while True:
    for i in range(n):
        if x[i]>m1:
            m1=x[i]
            index1=i
            if m1==100:
                break
    x[index1]=0
    for i in range(n):
        if x[i]>m2 and x[i]!=m1:
            m2=x[i]
            if m2==m1-1:
                break
    x[index1]=m1-m2
    for i in range(1,n):
        if x[0]!=x[i]:
            break
        else:
            flag+=1
    if flag==n-1:
        print(sum(x))  
        break
    m1=0
    m2=0 
    flag=0     
