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).
# BOOGEYMAN >>> Version 11.0
import os, sys, math, itertools, bisect
from string import ascii_lowercase, ascii_uppercase
from collections import deque, defaultdict, OrderedDict, Counter
ii,si = lambda : int(input()), lambda : input()               
mi, msi  = lambda : map(int,input().strip().split(" ")), lambda : map(str,input().strip().split(" ")) 
li, lsi = lambda : list(mi()), lambda : list(msi())

def BoogeyMan() -> None:
    '''
    Query
    '''
    from math import gcd
    n,q=int(input()),0
    for i in map(int,input().split()):q=gcd(q,i)
    print(q*n)
        
    
if __name__ == "__main__":
    try:
        from baba_yaga import cmdIO, _generator_
        def _BoogeyMan_() -> None : yield cmdIO(); yield BoogeyMan(); yield _generator_()
        master = _BoogeyMan_()
        try:
            while True: assert not next(master)
        except StopIteration: pass
    except (FileNotFoundError,ModuleNotFoundError): BoogeyMan()
 			  	 		 	  	     	  						 	