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 HCF(x,n):
    k = 1
    if sum(x)/x[0] == n:
        return x[0]
    else:
        x.sort()
        while True:
            for i in range(n-2,-1,-1):
                g = n-1
                if x[g] != x[i]:
                    x[g] -= x[i]
                    break
            if sum(x) / x[0] == n:
                return x[0]
            else: x.sort()


def m():
    n = eval(input())
    x = list(map(eval,input().split()))
    print(n * HCF(x,n))
m()