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

int main() {
	int n;
	cin >> n;
	vector<int> p(n);
	for (int i = 0; i < n; i++) cin >> p[i];
	vector<bool> used(n, true);
	used[p[n - 1] - 1] = false;
	int len = 0;
	for (int i = n - 2; i >= 0; i--) {
		len++;
		used[p[i] - 1] = false;
		if (p[i] < p[i + 1]) {
			p[i]++;
			while (used[p[i] - 1]) p[i]++;
			used[p[i] - 1] = true;
			break;
		}
	}
	int m = 0;
	for (int i = 0; i < n - len; i++) m = max(m, p[i]);
	int ptr = m - 1, add = -1;
	for (int i = n - len; i < n; i++) {
		while (true) {
			ptr += add;
			if (ptr == -1) {
				ptr = m;
				add = 1;
			}
			if (!used[ptr]) {
				used[ptr] = true;
				p[i] = ptr + 1;
				break;
			}
		}
	}
	for (int x : p) cout << x << " ";
	return 0;
}