#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve() {
	int n; cin >> n;
	vector<ll> a(n); for (auto& x : a) cin >> x;
	sort(a.begin(), a.end());

	vector<ll> dp(n);
	for (int i = 1; i < n; i++) {
		int l = 0, r = i-1;
		while (l < r) {
			int m = (l + r) / 2;
			ll x = dp[m] + a[i]/a[m], y = dp[m+1] + a[i]/a[m+1];
			if (x == y) {
				l = r = m;
			} else if (x < y) {
				r = m;
			} else {
				l = m+1;
			}
		}
		dp[i] = dp[l] + a[i]/a[l];
	}
	cout << dp[n-1] << endl;
}

int main() {
    cin.tie(0);
    cin.sync_with_stdio(0);

	int t = 1;
	while (t--) solve();
}