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

int main()
{
    int N, i, j;
    cin>>N;
    int hus[N];
    vector<int> db;
    db.resize(1000000);
    vector<int> kulonb;
    int mx=0;
    for (i=0; i<N; i++)
    {
        cin>>hus[i];
        db[hus[i]]+=1;
        if (count(kulonb.begin(), kulonb.end(), hus[i])==false)
        {
            kulonb.push_back(hus[i]);
        }
        if (hus[i]>mx) mx=hus[i];
    }
    //cout<<mx<<endl;
    int ki=0;
    for (i=0; i<kulonb.size(); i++)
    {
        ki+=db[kulonb[i]
        ]-1;
    }
    cout<<ki+mx<<endl;
}