#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
namespace LCT {
    int c[N][2], fa[N];
	int sum[N], tag[N], key[N], sz[N];
    bool rev[N];
    inline bool IsRoot(int x) {
        return c[fa[x]][0] != x && c[fa[x]][1] != x;
    }
    inline bool Type(int x) {
        return c[fa[x]][1] == x;
    }
    inline void PushUp(int x) {
		sum[x] = key[x] + sum[c[x][0]] + sum[c[x][1]];
		sz[x] = 1 + sz[c[x][0]] + sz[c[x][1]];
    }
	inline void SetAdd(int x, int v) {
		key[x] += v;
		sum[x] += v * sz[x];
		tag[x] += v;
	}
    inline void SetRev(int x) {
        rev[x] ^= 1;
        swap(c[x][0], c[x][1]);
    }
    inline void PushDown(int x) {
        if (rev[x]) {
            SetRev(c[x][0]);
            SetRev(c[x][1]);
            rev[x] = 0;
        }
		if (tag[x]) {
			SetAdd(c[x][0], tag[x]);
			SetAdd(c[x][1], tag[x]);
			tag[x] = 0;
		}
    }
    inline void Rotate(int x) {
        int y = fa[x], d = Type(x);
        fa[x] = fa[y]; if (!IsRoot(y)) c[fa[y]][Type(y)] = x;
        fa[c[x][!d]] = y; c[y][d] = c[x][!d];
        c[x][!d] = y; fa[y] = x;
        PushUp(y);
    }
    inline void Splay(int x) {
        static stack<int> sta;
        sta.push(x);
        int t = x; while (!IsRoot(t)) sta.push(t = fa[t]);
        while (!sta.empty()) PushDown(sta.top()), sta.pop();
        for (int i = fa[x]; !IsRoot(x); Rotate(x), i = fa[x])
            if (!IsRoot(i)) Rotate(Type(i) == Type(x) ? i : x);
        PushUp(x);
    }
    inline void Access(int x) {
        for (int t = 0; x; t = x, x = fa[x]) {
            Splay(x);
            c[x][1] = t;
            PushUp(x);
        }
    }
    inline void MakeRoot(int x) {
        Access(x); 
        Splay(x);
        SetRev(x);
    }
    inline void Link(int x, int y) {
        MakeRoot(x);
        fa[x] = y;
    }
    inline void Cut(int x, int y) {
        MakeRoot(x); 
        Access(y);
        Access(x);
        fa[y] = 0;
    }
    inline int GetRoot(int x) {
        Access(x); Splay(x);
        while (c[x][0]) x = c[x][0];
        Splay(x);
        return x;
    }
}

int nxt[N];

int main() 
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int q;
	cin>>q;
	int last=0;
	string s;
	while(q--)
	{
		string op;
		cin>>op;
		if(op=="add")
		{
			string t;
			cin>>t;
			char c=(t[0]-'a'+last)%26+'a';
			s+=c;
			int i=s.size()-1;
			int p=s.size()+1;
			LCT::sz[p]=1;
			if(i>0)
			{
				int j=nxt[i-1];
				while(j&&s[j]!=s[i])
					j=nxt[j-1];
				if(s[j]==s[i])
					j++;
				nxt[i]=j;
			}
			LCT::Link(p,nxt[i]+1);
			LCT::MakeRoot(1);
			LCT::Access(p);
			LCT::Splay(p);
			LCT::SetAdd(p,1);
		}
		else
		{
			int k;
			cin>>k;
			k=((k-1+last)%s.size())+1;
			LCT::Splay(k+1);
			cout<<(last=LCT::key[k+1])<<"\n";
		}
	}
	// for(int i=0;i<s.size();i++)
	// 	cout<<nxt[i]<<" ";
}