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())
a = list(map(int,input().split()))
if n==1:
    print(a[0])

else:
    s=set(a)
    b=[]
    for ele in s:
        b.append(ele)
    flag = False
    while flag!=True:
        b.sort()
        if  len(b)!=1 and b[-1]!=b[-2]:
            m1=b[-1]
            m2=b[-2]
            b[-1]-=b[-2]
        else:
            flag=True
    print(sum(b)+(len(a)-len(b))*a[-1])    