/*
written by- Piyush Golani
language- c++
country- India
College- N.I.T Jamshedpur
*/
#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<cctype>
using namespace std;
#define pb push_back
#define all(s) s.begin(),s.end()
#define f(i,a,b) for(int i=a;i<b;i++)
#define F(i,a,b) for(int i=a;i>=b;i--)
#define PI 3.1415926535897932384626433832795
#define INF 2000000000
#define BIG_INF 7000000000000000000LL
#define mp make_pair
#define eps 1e-9
#define si(n) scanf("%d",&n)
#define sll(n) scanf("%lld",&n)
#define mod 1000000007
#define mm 10000000
#define pd pair<double,int>

typedef long long LL;


string inttostring(int n)
{
    stringstream a;
    a<<n;
    return a.str();
}

int stringtoint(string A)
{
    istringstream a(A);
    int p;
    a>>p;
    return p;
}

//////////////////////////////////////////////////////

int A[16],T[16];

int update(int idx,int val)
{
    while(idx<=15)
    {
        T[idx]+=val;
        idx+=(idx&-idx);
    }
    return 0;
}

int read(int idx)
{
    int sum=0;
    while(idx>0)
    {
        sum+=T[idx];
        idx-=(idx&-idx);
    }
    return sum;
}
int main()
{
    int q;
    cin>>q;
    char c;
    int a,b;
    while(q--)
    {
        cin>>c;
        if(c=='T')
        {
            cin>>a>>b;
            //a- +1 and b+1- -1
            update(a,1);
            update(b+1,-1);
        }
        if(c=='Q')
        {
            cin>>a;
            if(read(a)%2==0) cout<<"0\n";
            else cout<<"1\n";
        }
    }
}