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).
a = int(input())
b = input().split()
ans = 0
q = len(b)
w = len(b)
b.sort()
while int(b[-1]) - int(b[0]) >= 1:
   if int(b[-1]) - int(b[0]) >= 1:    
      b[-1] = int(b[-1]) - int(b[0])
   for k in range(q):
      for t in range(0, q - 1):
         if int(b[t]) > int(b[t + 1]):
            b[t], b[t + 1] = b[t + 1], b[t]
for i in b:
   ans += int(i)
print(ans)



