#include<bits/stdc++.h>
using namespace std;
int n,q;
char c[201000],b[401000],a[400100];
int kmp[401000];
int bru(int m){
    for(int i=1;i<=m;i++)a[m-i+1]=a[i+m]=b[i];
    for(int i=2,j=0;i<=m*2;i++){
        while(j&&a[j+1]!=a[i])j=kmp[j];
        if(a[j+1]==a[i])j++;kmp[i]=j;
    }
    int u=m*2,s=0;while(u)s+=(u<=m),u=kmp[u];
    return s;
}
int main(){
    scanf("%s",c+1);n=strlen(c+1);
    scanf("%d",&q);
    if(n<=5000&&q<=5000){
        int lans=0;
        for(int i=1,op,x,l,r;i<=q;i++){
            char e[2];
            scanf("%d",&op);
            if(op==1){scanf("%d%s",&x,e),x^=lans;c[x]=e[0];}
            else{
                scanf("%d%d",&l,&r);
                l^=lans,r^=lans;
                for(int j=l;j<=r;j++)b[j-l+1]=c[j];
                printf("%d\n",lans=bru(r-l+1));
            }
        }
        return 0;
    }
    return 0;
}