#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <vector>
#include <bitset>

#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front

using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
typedef long long ll;
const ll Nmax=2e5+5, inf=1e9+5;
using pii=pair<int, int>;

int n;
unordered_map<int, bool> mp;
int main()
{
    fin>>n;
    int nr;
    char ch;
    for (int i=0; i<n; i++){
        fin>>ch>>nr;
        if (ch=='1')
            mp[nr]=1;
        else if (ch=='2')
            mp[nr]=0;
        else fout<<mp[nr]<<'\n';
    }
    return 0;
}