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).
'''input
2
18 30
'''
n = int(input())
d = 1e9
x = list(map(int, input().split()))
for i in range(n):
	for j in range(len(x)-1):
		if x[j+1]-x[j] > 0:
			d = min(d, x[j+1]-x[j])
			x.append(x[j+1]-x[j])
		elif x[j]-x[j+1] > 0:
			d = min(d, x[j]-x[j+1])
			x.append(x[j]-x[j+1])
		x = sorted(set(x))
if d == 1e9:
	print(sum(x))
else:
	d = min(d, min(x))
	print(n*d)