#include <iostream>
#include<vector>
#include<set>
#include<algorithm>

using namespace std;

int n,k,maximum=0;
vector<bool>volte;
vector<int>perm;
set<int>szabad;

int main()
{
    cin>>n;
    volte.assign(n+1,true);
    perm.resize(n+1);
    for(int i=1;i<=n;i++) cin>>perm[i];
    for(int i=n;i>=1;i--)
    {
        volte[perm[i]]=false;
        szabad.insert(perm[i]);
        if(szabad.upper_bound(perm[i])==szabad.end()) continue;
        k=*szabad.upper_bound(perm[i]);
        perm[i]=k;
        szabad.erase(k);
        volte[k]=true;
        for(int j=1;j<=i;j++)
        {
            cout<<perm[j]<<" ";
            maximum=max(maximum,perm[j]);
        }
        for(int j=maximum-1;j>=1;j--) if(!volte[j]) cout<<j<<" ";
        for(int j=maximum+1;j<=n;j++) if(!volte[j]) cout<<j<<" ";
        break;
    }
    return 0;
}