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 main():
    input_size = int(input())
    numbers = []
    for i in range(input_size):
        #print('Enter ',i,' value')
        value = int(input())
        numbers.append(value)
    #print(numbers)
    zeros_count,i = 0,0
    while True:
        #print(numbers)
        i=i%(input_size-1)
        if numbers[i]<numbers[i+1]:
            numbers[i+1] = numbers[i+1]-numbers[i]
            #print(i+1,'-',i,end='\n\n')
            zeros_count = 0
        elif numbers[i]>numbers[i+1]:
            numbers[i]=numbers[i]-numbers[i+1]
            #print(i,'-',i+1,end='\n\n')
            zeros_count = 0
        if numbers[i] == numbers[i+1]:
            zeros_count+=1
            #print(i,'and',i+1,'are equal');
        i+=1
        if zeros_count == input_size-1:
            break
        if zeros_count == 20:
            break;
    s = 0;
    for i in range(0,input_size,1):
        s+=numbers[i];
    print(s);
main()
