#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
using ll =long long;

void solve(){
    int N;
    cin>>N;
    vector<int> p(N);
    rep(i,0,N-1){
        int a;
        cin>>a;
        p[a-1]++;
    }
    int M=0,L=0;
    rep(i,0,N){
        if(p[i]!=1) M++;
        if(p[i]==0) L++;
    }
    rep(i,0,L){
        if(i) cout<<" ";
        cout<<min(M,2*i+1);
    }
    cout<<"\n";
}

int main(){
    int T=1;
    //cin>>T;
    while(T--) solve();
}