#include <fstream>
#include <algorithm>
using namespace std;
int v[1000005],f[1000005];
int newS[1000005];
int main()
{
    ifstream cin("hashuri.in");
    ofstream cout("hashuri.out");
    int n,op,x;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>op>>x;
        v[i]=x;
    }
    cin.close();
    sort(v+1,v+n+1);
    int cnt=0;
    for(int i=1;i<=n;i++)
        if(v[i]!=v[i+1])
            cnt++,newS[cnt]=v[i];
    ifstream cin1("hashuri.in");
    cin1>>n;
    for(int i=1;i<=n;i++)
    {
        cin1>>op>>x;
        int st=1,dr=cnt,retin;
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            if(newS[mij]<=x)
            {
                retin=mij;
                st=mij+1;
            }
            else
                dr=mij-1;
        }
        if(op==1)
            f[retin]++;
        else if(op==2)
        {
            if(f[retin]>0)
                f[retin]--;
        }
        else
        {
            if(f[retin]>0)
                cout<<"1\n";
            else
                cout<<"0\n";
        }
    }
    return 0;
}