lightoj 1080

#include<iostream>
#include<memory.h>
#include<algorithm>
#include<cstdio>
#include<string>
using namespace std;
int lowbit(int x) 
{
    return x&-x;
}
int d[100001];
int c[100001];
int n, m;
int gs(int x)
{
    int q = 0;
    for (int y = x;y > 0;y -= lowbit(y))q += c[y];
    return q;
}
void gengxin(int xiabiao, int zhi)
{
    for (int q = xiabiao;q <= n;q += lowbit(q))
    {
        c[q] += zhi;
        //if (c[q] < 0)c[q] = 0;
    }
}
int main()
{
    int T;
    cin >> T;
    int u = 0;
    while (T--)
    {
        memset(c, 0, sizeof(c));
        d[0] = 0;
        string oo;
        cin >> oo;
        n = oo.size();
        scanf("%d",&m);
        printf("Case %d:\n", ++u);
        char yy[10];
        int qq, ww;
        while (m--)
        {
            //getchar();
            scanf("%s", yy);
            if (yy[0] == 'I')
            {
                scanf("%d%d", &qq, &ww);
                gengxin(qq, 1);
                gengxin(ww+1, -1);
            }
            else
            {
                scanf("%d", &qq);
                if (gs(qq) % 2 == 0)
                {
                    printf("%c\n", oo[qq - 1]);
                }
                else
                {
                    printf("%d\n", !(oo[qq - 1] - '0'));
                }
            }
        }
    }
    return 0;
}