#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <cstring>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int a[100];
int g = INF;
int gcd(int a, int b){
    if(b == 0) return a;
    return gcd(b, a % b);
}
int main(){
    int n;
    cin >> n;
    rep(i, n) cin >> a[i];
    if(n == 1){
        puts("1");
        return 0;
    }
    rep(i, n - 1){
        for(int j = i + 1;j < n; j++){
            if(i != j){
                g = min(g, gcd(a[i], a[j]));
            }
        }
    }
    int ans = 0;
    rep(i, n) ans += a[i] / g;
    cout << ans << endl;       
    return 0;
}