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

flag = True
n = int(input())
inp = [int(x) for x in input().split()]
while flag == True:
    c = 0
    inp.sort(reverse=True)
    if len(inp) == 2 and inp[0] > inp[1]:
        inp[0] = inp[0]-inp[1]
        c += 1
    else:
        for i in range(n-1):
            if inp[i] > inp[i+1]:
                c += 1
                inp[i] = inp[i] - inp[i+1]
    if c == 0:
        flag = False

print(sum(inp))
# if len(inp) == 2 and inp[0]-inp[1] > 0:
#     min = inp[0]-inp[1]
# else:
#     for i in range(n-1):
#         if inp[i]-inp[i+1] < min and inp[i]-inp[i+1] > 0:
#             min = inp[i]-inp[i+1]
# if min == sys.maxsize:
#     print(inp[0]*n)
# elif min < inp[-1]:
#     print(min*n)
# else:
#     print(inp[-1]*n)
