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).
def findDiff(values):
    one = values[0]
    for val in values:
        if(val != one):
            return True
    return False

n = int(input())
values = input()
values = list(map(int, values.split(" ")))

while(findDiff(values)):
    curr = min(values)
    maximo = max(values)
    pos = 0
    for i in range(len(values)):
        if(values[i] != curr and values[i] <= maximo):
            maximo = values[i]
            pos = i
    values[pos] = values[pos] - curr
print(sum(values))

 	 	  	  	 				 		 	     		  		