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, os
import math
from itertools import combinations, permutations

TC = False

def find_gcd(x, y):
    while(y):
        x, y = y, x % y
    return x

def solve():
    n = int(input())
    l = list(map(int, input().split()))
    num1 = l[0]
    num2 = l[1]
    gcd = find_gcd(num1, num2)

    for i in range(2, len(l)):
        gcd = find_gcd(gcd, l[i])
        
    print(gcd*n)

if os.path.exists('input.txt'):
    debug = True
    sys.stdin = open("input.txt","r")
    #sys.stdout = open("output.txt","w")

if TC:
    for _ in range(int(input())):
        solve()
else:
    solve()