#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;

int main() {
    int n;
    cin >> n;

    int niza[n];
    for(int i = 0; i < n; i++) {
        cin >> niza[i];
    }
    sort(niza, niza + n);

    int S = 0, E = n - 1;
    int res = 0;
    while(S < E) {
        while(niza[S] > 0 and S < E) {
            niza[S]--;
            E--;
            res++;
        }
        S++;
    }
    cout << res << endl;

    return 0;
}