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 equal(x):
    for i in range(len(x)):
        if x[i - 1] != x[i]:
            return False
    return True

def get_value(x):
    for i in range(len(x)):
        if abs(x[i - 1] - x[i]) > 0:
            return abs(x[i - 1] - x[i])
    return False


n = int(input())
x = list(map(int, input().split()))
if len(x) == 1:
    print(x[0])
elif len(x) == 2:
    if x[0] == x[1]:
        print(x[0] + x[1])
    else:
        print(abs(x[0] - x[1]) * 2) #
else:
    min_value = get_value(x)
    if min_value:
        while not equal(x):
            for i in range(len(x)):
                for j in range(len(x)):
                    if i != j:
                        delta = x[i] - x[j]
                        if delta > 0:
                            x[i] = delta
                        else:
                            x[j] = delta
                        if abs(delta) < min_value:
                            min_value = delta

    print(x[0] * n) 