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)
l = list(map(int, input().split()))
def findDiff():
    count = 1
    for index in range(1, len(l)):
        if l[index] > l[index-1]:
            l[index] = l[index] - l[index-1]
            
        elif l[index-1] > l[index]:
            l[index-1] = l[index-1] - l[index]
        else:
            count = count+1
    if count < len(l):
        return findDiff()
    else:
        return



findDiff()
sum = 0
for index in range(len(l)):
    sum = sum+l[index]

print(sum)