#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <functional>
#include <cmath>
#include <set>
#include <deque>
#include <queue>
#include <utility>
#include <map>
#include <string>
#include <iomanip>
#include <cmath>
#include <utility>
#include <ctype.h>
#include <stdio.h>
#include <random>
#include <ctime>

#define mp make_pair

typedef long long ll;

using namespace std;

vector<int> z;
string s;

int get(int i) {
    return z[i];
}

int stupid(int i) {
    while ((z[i] < int(s.size())) && (s[i + z[i]] == s[z[i]])) z[i]++;
    return z[i];
}

void add(char c) {
    s += c;
    int n = int(s.size());
    for (int i = int(z.size()) - 1; i < n; i++) {
        if (stupid(i) == n - i) break;
        z.push_back(0);
    }
}

int main() {
    s = "aa";
    z.resize(2, -1);
    z[1] = 1;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        string zp;
        cin >> zp;
        if (zp == "add") {
            string c;
            cin >> c;
            add(c[0]);
        } else {
            int k;
            cin >> k;
            cout << get(k) << '\n';
        }
    }
}