#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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

    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }

    sort(v.begin(), v.end());

    int S = 0, E = n - 1;
    int res = 0;

    while(S < E) {
        while(v[S] > 0 and S < E) {
            E--;
            v[S]--;
            res++;
        }
        S++;
    }

    cout << res << endl;

}
 // 3 4 5 7 9