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).
x = int(input())
z = []
z[0:] = map(int,input().split())
z.sort()
w = list(z)
#print(z)
q = 0
while(1):
    for i in range(len(z)-1):
        if z[i+1] != w[i]:
            z[i + 1] = w[i + 1] - w[i]

    z.sort()
    w = list(z)

    #print(z)
    if min(z) == max(z):# or (z[0] == 0 and z[z.index(max(z))-1] == 0 ):
        break

print(sum(z))
