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).
# -*- coding: utf-8 -*-
"""
Created on Sat May  7 14:33:56 2016

@author: Alex
"""

n = int(input())
heap = list(map(int,input().split()))
s = 0
dif = 1
i = 0
while dif>0:
    heap.sort(reverse=True)
    i = 1
    while i<n:
        if heap[0]==heap[i]:
            i+=1
        else:
            break
    if i == n:
        break
    dif = heap[i]
    heap[0] -= dif
print(sum(heap))
    

