#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <set>
#include <cstdio>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <random>
#define int long long
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)


int gcd(int a, int b) { return b ? a : gcd(b, a % b); }

int toNum(char s) {
	return s - 'a';
}

const int inf = 1 << 31 - 1;
const int n = 100001;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

int tree[400008];
int a[100002];
int k, x, y,siz,q;

void build(int v, int left, int right) {
	if (left + 1 == right)
		tree[v] = 1;
	else {
		int mid = (left + right) / 2;
		build(2 * v, left, mid);
		build(2 * v + 1, mid, right);
		tree[v] = tree[2 * v] + tree[2 * v + 1];
	}
}


void update(int v, int left, int right, int pos, int kek) {
	if (left + 1 == right)
		tree[v] = kek;
	else {
		int mid = (left + right) / 2;
		if (pos < mid)
			update(2 * v, left, mid, pos, kek);
		else
			update(2 * v + 1, mid, right, pos, kek);
	}
	tree[v] = tree[2 * v] + tree[2 * v + 1];

}

int get_sum(int v, int left, int right, int r) {
	if (0 <= left && right <= r)
		return tree[v];
	if (right <= 0 || r <= left)
		return 0;
	int mid = (left + right) / 2;
	return get_sum(2 * v, left, mid,r) + get_sum(2 * v + 1, mid, right,r);
}

int get_place(int v, int left, int right, int k) {
	if (left + 1 == right)
		return left;
	int mid = (left + right) / 2;
	if (k > tree[2 * v])
		get_place(2 * v, left, mid,k);
	else
		get_place(2 * v + 1, mid , right, k - tree[2 * v]);
}


void solve() {
	cin >> siz;
	for (int i = 0; i < siz; i++) {
		cin >> q;
		if (q > 0) {
			cout << get_place(1, 0, n, get_sum(1, 0, n, q)) << "\n";
			update(1, 0, n, get_sum(1, 0, n, q ), 0);
		}
		else
			update(1, 0, n, q + 1, 1);
	}
}


unsigned main() {
	//freopen("rvq.in", "r", stdin);
	//freopen("rvq.out", "w", stdout);

	IOS;
	build(1,0,n);
	solve();
}