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).

def log(*args): 
    #print(*args)
    pass

N = int(input())
L = [int(n) for n in input().split()]
assert N == len(L)
L.sort()

changed = True

while changed:
    log('begin, L=', L)
    blah = L[:]
    changed = False
    for i in range(N):
        for j in range(i):
            num = L[i] + L[j]
            if num not in blah:
                blah.append(num)

    log('blah', blah)

    for i in range(N):
        num = L[i]
        for n in range(num-1, -1, -1):
            if n in blah:
                log('pos', i, 'subtracting', n, 'from', L[i])
                L[i] = num - n
                changed = True
                break
    
    log(sum(L))

log('fin')
print(sum(L))
