#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define ull unsigned long long 
#define sz(a) ((int) a.size())
#define vi vector<int>
#define me(a, x) memset(a, x, sizeof(a))
#define uint unsigned int 
using namespace std;
const int N = 4e5 + 7, B = 37;

struct segmenttree {
	
}; 

int n, q;
char s[N];
namespace gao { // i use luan gao 

char t[N];
uint hs[20][N], ht[20][N], pw[N];
void changes(int x, char c) {
	uint dec = c - s[x], cur = dec;
	s[x] = c;
	for(int d = 0; d <= 17; d += 2) {
		dec = cur;
		int kd = 1 << d;
		
		int wl = max(x - kd + 1, 1), wr = min(x, n - kd + 1);
		dec *= pw[x - wr];
		if(wr >= wl) { 
			for(auto u = hs[d] + wr; u != hs[d] + wl - 1; --u) *u += dec, dec *= B;
		}
	}
}
void changet(int x, char c) {
	uint dec = c - t[x], cur = dec;
	t[x] = c;
	for(int d = 0; d <= 17; d += 2) {
		int kd = 1 << d;
		dec = cur;
		
		int wl = max(x - kd + 1, 1), wr = min(x, n - kd + 1);
		dec *= pw[x - wr];
		if(wr >= wl) 
			for(auto u = ht[d] + wr; u != ht[d] + wl - 1; --u) *u += dec, dec *= B;
	}
}
void inits() {
	L(i, 1, n) hs[0][i] = s[i];
	L(i, 1, 17) 
		L(j, 1, n - (1 << i) + 1) 
			hs[i][j] = hs[i - 1][j] + hs[i - 1][j + (1 << (i - 1))] * pw[1 << (i - 1)];
	
}
void initt() {
	L(i, 1, n) ht[0][i] = t[i];
	L(i, 1, 17) 
		L(j, 1, n - (1 << i) + 1) 
			ht[i][j] = ht[i - 1][j] + ht[i - 1][j + (1 << (i - 1))] * pw[1 << (i - 1)];
}

int lg[N];
int main() {
	pw[0] = 1;
	L(i, 1, n) pw[i] = pw[i - 1] * B;
	L(i, 1, n) t[i] = s[n - i + 1];
	L(i, 2, n) lg[i] = lg[i >> 1] + 1;
	inits();
	initt();
	int lst = 0;
	while(q--) {
		int op;
		cin >> op ;
		if(op == 1) {
			int i;
			string sss;
			cin >> i >> sss;
			i ^= lst;
			assert(1 <= i && i <= n);
			char c = sss[0];
			changes(i, c);
			changet(n - i + 1, c);
		} else {
			int l, r;
			cin >> l >> r;
			l ^= lst, r ^= lst;
			assert(1 <= l && l <= r && r <= n);
			
			int xlen = r - l + 1;
			int ns = 0;
			
			l = n - r + 1; 
			L(d, 0, lg[xlen]) {
				int wl = (1 << d), wr = min(xlen, (1 << (d + 1)) - 1);
				int pr = r - (1 << d) + 1;
				int l1 = l, l2 = l, r1 = pr, r2 = pr;
				int lp = -1;
				if(!(d & 1)) {
					r1 -= wr - wl;
					l2 += wr - wl;
					R(len, wr, wl) {
						if(ht[d][l1] == hs[d][r1] && ht[d][l2] == hs[d][r2]) {
							++ns;
							if(lp == -1) {
								lp = len;
							} else {
								ns += (len - wl) / (lp - len);
								break;
							}
						}
						++r1, --l2;
					}
				} else {
					r1 -= wr - wl;
					l2 += wr - wl;
					int OP = (1 << (d - 1));
					R(len, wr, wl) {
						if(ht[d - 1][l1] == hs[d - 1][r1] && 
							ht[d - 1][l1 + OP] == hs[d - 1][r1 + OP] && 
							ht[d - 1][l2] == hs[d - 1][r2] && 
							ht[d - 1][l2 + OP] == hs[d - 1][r2 + OP]) {
								++ns;
								if(lp == -1) {
									lp = len;
								} else {
									ns += (len - wl) / (lp - len);
									break;
								}
							}
						++r1, --l2;
					}
				}
			}
			cout << ns << '\n';
			lst = ns;
		}
	}
	return 0;
} 


}

int ch[N][26], cov[N], dep[N], f[N], len[N], p;
int getfa(int x) {
	for(; p < len[x] + 1 || s[p - len[x] - 1] != s[p]; x = f[x]) ;
	return x;
}
int lst, tot = 1; 
void ins() {
	lst = getfa(lst);
	if(!ch[lst][s[p] - 'a']) 
		++tot, f[tot] = ch[getfa(f[lst])][s[p] - 'a'], ch[lst][s[p] - 'a'] = tot, len[tot] = len[lst] + 2,
		dep[tot] = dep[f[tot]] + 1;
	lst = ch[lst][s[p] - 'a'];
}
int Pos[N], jp[20][N];

char t[N]; 
uint hs[20][N], ht[20][N];
uint ps[N], pt[N], pw[N];
void changes(int x, char c) {
	s[x] = c;
}
int lg[N];
uint S[N];
int main() {
//	return system("fc ovo.out qwq.out"), 0;
//	freopen("data.in", "r", stdin);
//	freopen("ovo.out", "w", stdout);
	ios :: sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	f[0] = 1, len[1] = -1;
	cin >> (s + 1);
	n = strlen(s + 1);
	cin >> q;
	
	if(n <= 2e5 && q <= 5e4) {
		gao :: main();
		return 0;
	}
	
	pw[0] = 1;
	L(i, 1, n) 
		pw[i] = pw[i - 1] * B;
	L(i, 1, n) {
		S[i] = s[i] - 'a' + 1;
		p = i;
		ins();
		Pos[i] = lst; 
	}
	
	L(i, 2, n) 
		lg[i] = lg[i >> 1] + 1;
	
	L(i, 1, tot) 
		jp[0][i] = f[i];
	L(o, 1, 19)
		L(i, 1, tot) {
			jp[o][i] = jp[o - 1][jp[o - 1][i]];
		}
	
	int k = 5e3;
	if(n > 5e3) {
		k = 100;
	}
	int lst = 0;
	bool ok = true;
	while(q--) {
		int op;
		cin >> op ;
		if(op == 1) {
			int i;
			string sss;
			cin >> i >> sss;
			i ^= lst;
			char c = sss[0];
			s[i] = c;
			S[i] = c - 'a' + 1;
			ok = false;
		} else {
			int l, r;
			cin >> l >> r;
			l ^= lst, r ^= lst;
			
			if(ok) {
				int ns = 0;
				
				int cur = Pos[r];
				R(o, 18, 0) 
					if(len[jp[o][cur]] > r - l + 1) 
						cur = jp[o][cur];
				
				if(len[cur] > r - l + 1) 
					cur = f[cur];
				
				R(o, 18, 0) 
					if(jp[o][cur] > 1) 
						cur = jp[o][cur], ns += 1 << o;
				while(cur > 1) 
					ns += 1, cur = f[cur];
				
				cout << ns << '\n'; 
				lst = ns;
				
				continue;
			}
			
			int ns = 0;
			unsigned long long a = 0, b = 0, pw = 1;
			auto u = S + r;
			
			int len = min(r - l + 1, k);
			L(i, 1, len) {
				a = a * B + *u, b += pw * *u, pw *= B, ns += a == b, --u;
			}
			cout << ns << '\n';
			lst = ns;
		}
	}
	return 0;
}