// No.339 何人が回答したのか
// https://yukicoder.me/problems/no/339
//

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;

unsigned int solve(vector<unsigned int> &answers, unsigned int N);
unsigned gcd(unsigned int u, unsigned int v);


unsigned gcd(unsigned int u, unsigned int v) {
    while ( v != 0) {
        unsigned int r = u % v;
        u = v;
        v = r;
    }
    return u;
}


int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    unsigned int N;
    cin >> N;
    vector<unsigned int> answers(N);
    for (auto i = 0; i < N; ++i)
        cin >> answers[i];

    unsigned int res = solve(answers, N);
    cout << res << endl;
}

unsigned int solve(vector<unsigned int> &answers, unsigned int N) {
    set<unsigned int> u_answers(answers.begin(), answers.end());

    unsigned int prev_gcd = *u_answers.begin();
    for (auto u:u_answers) {
        prev_gcd = gcd(prev_gcd, u);
    }

    unsigned int ans = 0;
    for (auto a: answers) {
        ans += a / prev_gcd;
    }
    return ans;
}