#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 o1 = 0;
	rep(i, 1, n) {
		o1 += a[i] / a[i-1];
	}
	o1 += a[0] / a[n-1];

	reverse(a, a+n);
	ll o2 = 0;
	rep(i, 1, n) {
		o2 += a[i] / a[i-1];
	}
	o2 += a[0] / a[n-1];
	cout << min(o1, o2) << endl;
}