#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <set>
#include <sstream>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <iomanip>
using namespace std;

typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)

#include <iostream>
using namespace std;

int gcd( int m, int n )
{
    if ( ( 0 == m ) || ( 0 == n ) )
        return 0;
    
    while( m != n )
    {
        if ( m > n ) m = m - n;
        else         n = n - m;
    }
    return m;
}

int main(){
    int n;
    cin>>n;
    vector<int> v(n);
    int sum = 0;
    for(int i = 0; i < n;i++)
    {
        cin >> v[i];
        sum += v[i];
    }
    if(n == 1)
    {
        cout << 1 << endl;
        return 0;
    }
    int g = v[0];
    for(int i = 1; i < n;i++)
    {
        g = gcd(g, v[i]);
    }
    cout << (sum/g) << endl;
    return 0;
}