#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

int main()
{
	int N;
	cin >> N;
	int a[100];
	
	for (int i = 0; i < N; i++) {
		cin >> a[i];
	}
	
	bool flag = 1;
	int i;
	for (i = a[N - 1]; flag; i--) {
		flag = 0;
		for (int j = 0; j < N; j++) {
			if ((a[j] % i) != 0)
				flag = 1;
		}
	}

	i++;
	int sum = 0;
	for (int j = 0; j < N; j++) {
		sum += a[j] / i;
	}
	cout << sum << endl;
	return 0;
}