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 heapq_max

n=int(input())
l=list(map(int,input().split()))
heapq_max.heapify_max(l)
while len(set(l))!=1:
    y1=heapq_max.heappop_max(l)
    y2=heapq_max.heappop_max(l)
    if y1==y2:
        t=[y2]
        h=heapq_max.heappop_max(l)
        while h==y1:
            t.append(h)
            h=heapq_max.heappop_max(l)
        for i in t:
            heapq_max.heappush_max(l,i)
        heapq_max.heappush_max(l, y1-h)
        heapq_max.heappush_max(l,h)
    else:
        heapq_max.heappush_max(l, y1-y2)
        heapq_max.heappush_max(l, y2)
    #print(l)
print(l[0]*len(l))