#include <bits/stdc++.h>
using namespace std;
#define clo 1000.*clock()/CLOCKS_PER_SEC
#ifndef xxzx
#define endl '\n'
#endif
using ll=long long;
using PII=pair<int,int>;
const int N=1e6+10;
bool memory1;
int a[N],nxt[N],c[N],id[N],cnt,top[N];
struct BIT {
    vector<int> v;
    int lowbit(int x) { return x&-x; }
    void Add(int x,int val) {
        x=N-x;
        for(int i=x;i<N;i+=lowbit(i)) v[N-1-i]+=val;
    }
    int Qry(int x) {
        int res=0;
        x=N-x;
        for(int i=x;N-i<=(int)v.size();i-=lowbit(i)) res+=v[N-1-i];
        return res;
    }
    void add() { v.push_back(0); }
}bit[N];
bool memory2;
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int Q,lst=0; cin>>Q;
    int n=0;
    while(Q--) {
        string op; cin>>op;
        if(op=="add") {
            char ch; cin>>ch;
            a[++n]=(ch-'a'+lst)%26;

            int p=nxt[n-1];
            while(p&&a[p+1]!=a[n]) p=nxt[p];
            if(n>1&&a[p+1]==a[n]) nxt[n]=p+1;

            if(nxt[n]*2>n) top[n]=top[nxt[n]],c[n]=c[nxt[n]]+1;
            else top[n]=n,c[n]=1,id[n]=++cnt;
            bit[id[top[n]]].add();

            p=n;
            while(p) {
                bit[id[top[p]]].Add(c[p],+1);
                p=nxt[top[p]];
            }
        }
        if(op=="get") {
            int k; cin>>k;
            k=(k-1+lst)%n+1;
            lst=bit[id[top[k]]].Qry(c[k]);
            cout<<lst<<endl;
        }
    }

    #ifdef xxzx
    cerr<<"Time: "<<clo<<"MS"<<endl;
    cerr<<"Memory: "<<abs(&memory1-&memory2)/1024./1024.<<"MB"<<endl;
    #endif
    return 0;
}