#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;


int gcd( int a, int b ) {
    
    if ( b == 0 ) { return a; }
    
    return gcd( b, a%b );
}


int main() {
    
    int N;
    cin >> N;
    vector<int> A(N);
    int s = 0;
    for ( int i = 0; i < N; i++ ) {
        cin >> A[i];
        s += A[i];
    }
    
    int a = A[0];
    for ( int i = 1; i < N; i++ ) {
        a = gcd( a, A[i] );
    }
    
    cout << ( s / a ) << endl;
    
    
    
    return 0;
}