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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair


#define MAXN 200'010
ll a[MAXN];

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	int n;
	cin >> n;
	rep(i, 0, n) cin >> a[i];

	sort(a, a+n);
	ll out = LLONG_MAX;

	rep(blah, 0, 2) {
	
	ll med = 0;
	rep(i, 0, n-1) med += a[i+1]/a[i];
	med += a[0]/a[n-1];

	out = min(out, med);


	rep(i, 1, n-1) {
		// [0, i] increasing
		// [i+1, n] decreasing

		// i was after i+1 and before 0
		med -= a[i]/a[i+1];
		med -= a[0]/a[i];

		// i is now after i-1 and before n
		med += a[i]/a[i-1];
		med += a[n]/a[i];
		out = min(out, med);
	}

	}

	cout << out << '\n';
}