#include <iostream>
#include <vector>
#include <utility>
#include <numeric>

using namespace std;

int gcd(int a, int b) {
	do {
		if (a < b) {
			swap(a, b);
		}
		a = a % b;
	} while (a != 0);
	return b;
}

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	int result;
	if (n == 1) {
		result = 1;
	} else {
		int divisor = gcd(a[0], a[1]);
		for (int i = 2; i < n; ++i) {
			divisor = gcd(divisor, a[i]);
		}
		result = accumulate(a.begin(), a.end(), 0) / divisor;
	}
	cout << result << endl;
	return 0;
}