#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int q;
	scanf("%d", &q);
	priority_queue<int, vector<int>, greater<int>> pq_insert, pq_erase;
	while (q--) {
		int t, x;
		scanf("%d %d", &t, &x);
		if (t == 1) pq_insert.push(x);
		else pq_erase.push(x);
		while (!pq_erase.empty() && pq_insert.top() == pq_erase.top()) {
			pq_insert.pop();
			pq_erase.pop();
		}
		printf("%d\n", pq_insert.empty() ? -1 : pq_insert.top());
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBxOwoJc2NhbmYoIiVkIiwgJnEpOwoJcHJpb3JpdHlfcXVldWU8aW50LCB2ZWN0b3I8aW50PiwgZ3JlYXRlcjxpbnQ+PiBwcV9pbnNlcnQsIHBxX2VyYXNlOwoJd2hpbGUgKHEtLSkgewoJCWludCB0LCB4OwoJCXNjYW5mKCIlZCAlZCIsICZ0LCAmeCk7CgkJaWYgKHQgPT0gMSkgcHFfaW5zZXJ0LnB1c2goeCk7CgkJZWxzZSBwcV9lcmFzZS5wdXNoKHgpOwoJCXdoaWxlICghcHFfZXJhc2UuZW1wdHkoKSAmJiBwcV9pbnNlcnQudG9wKCkgPT0gcHFfZXJhc2UudG9wKCkpIHsKCQkJcHFfaW5zZXJ0LnBvcCgpOwoJCQlwcV9lcmFzZS5wb3AoKTsKCQl9CgkJcHJpbnRmKCIlZFxuIiwgcHFfaW5zZXJ0LmVtcHR5KCkgPyAtMSA6IHBxX2luc2VydC50b3AoKSk7Cgl9CglyZXR1cm4gMDsKfQ==

OAoxIDIKMSAzCjEgMQoyIDIKMiAxCjEgNQoyIDMKMiA1

8
1 2
1 3
1 1
2 2
2 1
1 5
2 3
2 5