#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define all(x) ((x).begin()), ((x).end())
#define pb push_back
const int N = 200022;
LL a[N];
int main() {
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++) {
        scanf("%lld", &a[i]);
    }
    sort(a, a + n);
    reverse(a, a + n);
    for (int i = 0, j; i + 1 < n; i = j) {
        for (j = i + 1; j < n && a[i] / a[j] == a[i] / a[i + 1]; j++);
        if (j < n && a[j - 1] / a[j] < a[i + 1] / a[j]) {
            j--;
        }
        reverse(a + i + 1, a + j);
    }
    LL ans = 0;
    for (int i = 0; i + 1 < n; i++) {
        ans += a[i] / a[i + 1];
    }
    printf("%lld\n", ans);
}