#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long

using namespace std;
using namespace __gnu_pbds;

inline int read(){
	int w = 1, s = 0;
	char c = getchar();
	for (; c < '0' || c > '9'; w *= (c == '-') ? -1 : 1, c = getchar());
	for (; c >= '0' && c <= '9'; s = 10 * s + (c - '0'), c = getchar());
	return s * w;
}

const int INF = 0x3f3f3f3f3f3f3f3f, N = 1e6 + 5;

int Q, T, n, lst, nxt[N], fa[N], tot, top[N], id[N], p[N];
char ch, op[10], s[N];
// multiset<pair<int, int> > S[N];
tree<pair<int, int>, null_type, less<pair<int, int> >, rb_tree_tag, tree_order_statistics_node_update> S[N];

void modify(int u, int n){
    while (u) S[p[u]].insert({id[u], n}), u = fa[top[u]];
}

void add(int n){
    int j = nxt[n - 1];
    while (j && s[j + 1] != s[n]) j = nxt[j];
    if (s[j + 1] == s[n]) j++;
    nxt[n] = j;
    if (n == 1) nxt[n] = 0;
    fa[n] = nxt[n];
    if (n - fa[n] == fa[n] - fa[fa[n]]){
        top[n] = top[fa[n]];
        id[n] = id[fa[n]] + 1;
        p[n] = p[fa[n]];
    }
    else top[n] = n, id[n] = 1, p[n] = ++tot;
    modify(n, n);
}

int query(int k){
    int pos = p[k];
    return S[pos].size() - S[pos].order_of_key({id[k], 0});
}

signed main(){
	int st = clock();
    // freopen("chameleon/chameleon3.in", "r", stdin);
    // freopen("chameleon.in", "r", stdin);
    // freopen("chameleon.out", "w", stdout);
	Q = read(), T = 1;
	while (Q--){
		scanf("%s", op + 1);
		if (op[1] == 'a'){
            ch = getchar();
            while (ch < 'a' || ch > 'z') ch = getchar();
			ch = 'a' + (((ch - 'a') + lst * T) % 26);
            s[++n] = ch, add(n);
		}
		else{
			int k = (read() - 1 + lst * T) % n + 1;
			printf("%lld\n", lst = query(k));
		}
	}
	cerr << 1.0 * (clock() - st) / CLOCKS_PER_SEC << endl;
	return 0;
}