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

fox_numbers = list(map(int, input().split()))

if list(set(fox_numbers)) == 1:
    print(sum(fox_numbers))
else:
    answer = []
    times = 0
    while True:
        if len(answer) > 1 and all(e == answer[0] for e in answer):
            break
        elif times == 1:
            times = 0
            fox_numbers = answer.copy()
            answer = []
        for i in range(N):
            idx = -1
            for j in range(N):
                if i == j:
                    continue
                if fox_numbers[i] > fox_numbers[j]:
                    idx = j
            if idx > -1:
                answer.append(fox_numbers[i] - fox_numbers[idx])
            else:
                answer.append(fox_numbers[i])
        times += 1

    print(sum(answer))
