#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
 
int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//

    int N;
	cin>>N;
	int A[50];
	rep(i,N){
		cin>>A[i];
	}

	vector<int> No;
	rep(i,N){
		No.push_back(i);
	}
	int num;
	bool use[50];
	bool make;
	do{
		make = false;
		/*rep(i,N){
			cout << No[i] << " ";
		}*/
		cout << endl;
		num = -1;
		rep(i,N){
			if(A[i] == No[i]){
				num = i;
				break;
			}
		}
		if(num == -1){
			break;
		}
		
		for(;;)
		{
			if(No[num] < N-1){
				rep(i,N) use[i] = false;
				++No[num];
				rep(i,num){
					use[ No[i] ] = true;
				}
				while( No[num] < N && use[ No[num] ] == true)
				{++No[num];}
						
				if( No[num] < N){
					use[ No[num] ] = true;
					for(int i = num+1;i<N;++i){
						rep(j,N){
							if(use[j] == false){
								No[i] = j;
								use[j] = true;
								break;
							}
						}
					}
					make = true;
					break;
				}
			}
			
			if( No[num] >= N-1){
				--num;
				if(num < 0){
					P(-1);
					return 0;
				}
			}
		}
	}while( make==true || next_permutation(No.begin(),No.end()) );
	rep(i,N)P(No[i]);
    return 0;
}