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 math
n = int(input())
ins = [int(x) for x in input().split()]

mn = min(ins)

primeNumbers = [2 , 3]

for i in range(5 , math.ceil(math.sqrt(mn)) , 2):
    isPrime = True
    for j in primeNumbers:
        if i % j == 0 :
            isPrime = False
            break
    if isPrime:
        primeNumbers.append(i)
primeNumbers.insert(0 , 1)

HCMs = []
for index in range(len(primeNumbers)):
    HCMs.insert(index , primeNumbers[index])
    HCMs.insert(-1-index , mn // primeNumbers[index])

for hcm in HCMs:
    isRight = True
    for num in ins:
        if num % hcm != 0:
            isRight = False
    if isRight:
        break

print(hcm * n)