#include<bits/stdc++.h>
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define mid ((l+r)>>1)
using namespace std;
typedef long long ll; typedef unsigned long long ull;
const int MAXN = 2e5+10,base = 13331;
char s[MAXN];
int n,q,lst;

ull pw[MAXN];

namespace T1{
    ull h[MAXN],rh[MAXN];
    void solve(){
        while(q--){
            int o; cin>>o;
            if(o==1){
                int x; char c; cin>>x>>c; x ^= lst;
                s[x] = c;
            }else{
                int l,r; cin>>l>>r; l ^= lst,r ^= lst;
                for(int i=1;i<=n;i++)h[i] = h[i-1] * base + (s[i]-'a'+1);
                for(int i=n;i>=1;i--)rh[i] = rh[i+1] * base + (s[i]-'a'+1);
                lst = 0; 
                for(int j=l;j<=r;j++){
                    ull H = h[r] - h[j-1] * pw[r-j+1];
                    ull rH = rh[j] - rh[r+1] * pw[r-j+1];
                    if(H==rH)lst++;
                }
                cout<<lst<<"\n";
            }
        }
    }
}

int o[MAXN],x[MAXN],l[MAXN],r[MAXN]; char c[MAXN];

namespace T3{
    struct Seg{
        ull h[MAXN<<2],rh[MAXN<<2];
        void pu(int x,int l,int r){
            h[x] = h[lc(x)] * pw[r-mid] + h[rc(x)];
            rh[x] = rh[rc(x)] * pw[mid-l+1] + rh[lc(x)];
        }
        void build(int x,int l,int r){
            if(l==r){
                h[x] = rh[x] = s[l] - 'a' + 1;
                return;
            }
            build(lc(x),l,mid); build(rc(x),mid+1,r);
            pu(x,l,r);
        }
        void mdf(int x,int l,int r,int pos,char c){
            if(l==r){
                h[x] = rh[x] = c-'a'+1;
                return;
            }
            (pos<=mid) ? mdf(lc(x),l,mid,pos,c) : mdf(rc(x),mid+1,r,pos,c);
            pu(x,l,r);
        }
        void qA(int x,int l,int r,int ql,int qr,ull& v){
            if(ql>qr)return;
            if(ql<=l && qr>=r){
                v = v*pw[r-l+1]+h[x];
                return;
            }
            if(ql<=mid)qA(lc(x),l,mid,ql,qr,v);
            if(qr>mid)qA(rc(x),mid+1,r,ql,qr,v);
        }
        void qB(int x,int l,int r,int ql,int qr,ull& v){
            if(ql>qr)return;
            if(ql<=l && qr>=r){
                v = v*pw[r-l+1]+rh[x];
                return;
            }
            if(qr>mid)qB(rc(x),mid+1,r,ql,qr,v);    
            if(ql<=mid)qB(lc(x),l,mid,ql,qr,v);
        }
    }seg;

    void solve(){
        seg.build(1,1,n);
        for(int i=1;i<=q;i++){
            if(o[i] == 1){
                x[i] ^= lst;
                seg.mdf(1,1,n,x[i],c[i]);
            }else{
                l[i] ^= lst,r[i] ^= lst;
                lst = 0;
                for(int j=r[i];j>=l[i] && j>=r[i]-60;j--){
                    ull H = 0,rH = 0;
                    seg.qA(1,1,n,j,r[i],H); seg.qB(1,1,n,j,r[i],rH);
                    if(H == rH)lst++;
                }
                cout<<lst<<"\n";
            }
        }
    }
}

int main(){
    //freopen("sauce.in","r",stdin);
    //freopen("sauce.out","w",stdout);

    ios::sync_with_stdio(false); cin.tie(0);
    cin>>(s+1); n = strlen(s+1);  
    pw[0] = 1; for(int i=1;i<=n;i++)pw[i] = pw[i-1]*base;
    cin>>q;
    if(max(n,q) <= 5000){
        T1::solve();
        exit(0);
    }
    int flag = 1;
    for(int i=1;i<=q;i++){
        cin>>o[i];
        if(o[i] == 1){
            flag = 0; 
            cin>>x[i]>>c[i];
        }else cin>>l[i]>>r[i];
    }
    if(!flag){
        T3::solve();
        exit(0);
    }

    return 0;
}