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).
firstEntry = True
codeNotDone = True
sameList = False
numofNums = int(input())
numbersGiven = []
numbersGiven = input().split(' ')
for i in range(0,len(numbersGiven)):
    numbersGiven[i] = int(numbersGiven[i])
    if numbersGiven[i] == 1:
        codeNotDone = False
        print(numofNums)

while codeNotDone and not sameList:
    if not firstEntry:
        numbersGiven = n
    else:
        firstEntry = False
    n = sorted(numbersGiven)
    if n[0] == n[-1]:
        sameList = True
    while n[-1] > n[0]:
        n[-1] = n[-1] - n[0]
if codeNotDone:
    print(n[0]*numofNums)