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()


factors = []
#find the factors of the first thing
for x in range (1,int(b[0])+1):
	if int(b[0])%x == 0:
		factors.append(str(x))

hc = 1
#find the highest common factor
for y in range (0,len(factors)):
	c = 0
	for z in range (0,a):
		
		if int(b[z])%int(factors[y]) == 0:
			c = c+1
		if c == a:
			hc = int(factors[y])

d = 0
for p in range (0,a):
	if int(b[p]) == int(b[0]):
		d = d + 1

if d == a:
	print(str(int(b[0] * a)))
else:
	print(str(hc*a))

		