#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 2e5 + 10;
int a[N], n;
int f[N];

signed main() {
    scanf("%lld", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
    }
    sort(a + 1, a + n + 1);
    memset(f, 0x3f, sizeof(f));
    f[n] = 0;
    for (int i = n - 1; i; --i) {
        for (int k = 2; k <= 20; ++k) {
            int j = lower_bound(a + 1, a + n + 1, a[i] * k) - a;
            f[i] = min(f[i], f[j - 1] + k);
        }
        f[i] = min(f[i], f[i + 1] + (a[i + 1] / a[i]));
    }
    printf("%lld\n", f[1]);
    return 0;
}