#include <bits/stdc++.h>
using namespace std;

map<int, int> lav;
const int N = 1e6 + 1;
int val[N];
int used[N];


const int L = 90;
struct H {
    unsigned long long x[L];

    H() {
        for (int i = 0; i < L; ++i) {
            x[i] = 0;
        }
    }

    H(int v) {
        mt19937_64 Rng(v);
        for (int i = 0; i < L; ++i) {
            x[i] = Rng();
        }
        int p = val[v];
        for (int i = 0; i < 4; ++i) {
            x[p % L] = 0;
            p /= L;
        }
    }

    H operator^(const H &q) {
        H r;
        for (int i = 0; i < L; ++i)
            r.x[i] = x[i] ^ q.x[i];
        return r;
    }

    int get() {
        int pos = 0, now = 0;
        for (int i = 0; i < L; ++i) {
            if (x[i] == 0) {
                now++;
            }
        }
        if (now == L) return 0;
        if (now != 4) return -1;
        for (int i = 0; i < L; ++i) {
            if (x[i] == 0) {
                pos *= L;
                pos += i;
            }
        }
        H check(lav[pos]);
        for (int i = 0; i < L; ++i) {
            if (this->x[i] != check.x[i]) return -1;
        }
        return lav[pos];
    }

    void print() {
        for (int i = 0; i < L; ++i) {
            cerr << x[i];
            continue;
            string s;
            unsigned long long kek = x[i];
            while (kek) {
                s += "01"[kek % 2];
                kek /= 2;
            }
            while (s.size() < 64) s += "0";
            reverse(s.begin(), s.end());
            cout << s;
        }
        cout << '\n';
    }
};

string out(H r) {
    string kek = "";
    for (int i = 0; i < L; ++i) {
        for (int k = 63; k >= 0; --k) {
            if ((r.x[i] >> k) & 1)
                kek += "1";
            else
                kek += "0";
        }
    }
    string ans;
    for (int i = 0; i < 5760; i += 6) {
        int val = 0;
        for (int j = 0; j < 6; ++j) {
            if (kek[i + j] == '1') val += (1 << j);
        }
        ans += char(33 + val);
    }
    return ans;
}

H in(string s) {
    string kek;
    for (int i = 0; i < 960; ++i) {
        int x = int(s[i]) - 33;
        for (int j = 0; j < 6; ++j) {
            if ((x >> j) & 1) {
               kek += "1"; 
            }
            else {
                kek += "0";
            }
        }
    }
    H r;
    for (int i = 0; i < 5760; i += 64) {
        for (int j = 63; j >= 0; --j) {
            if (kek[i + (63 - j)] == '1') {
                r.x[i / 64] |= (1LL << j);
            }
        }
    }
    return r;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
     
    for (int i = 0, now = 0; i < L; ++i) {
        for (int j = i + 1; j < L; ++j) {
            for (int k = j + 1; k < L; ++k) {
                for (int l = k + 1; l < L; ++l) {
                    now++;
                    val[now] = (((i * L + j) * L + k) * L + l);
                    lav[(((i * L + j) * L + k) * L + l)] = now;
                    if (now == 1000000) break;
                }
                if (now == 1000000) break;
            }
            if (now == 1000000) break;
        }
        if (now == 1000000) break;
    }
    string s;
    cin >> s;
    if (s == "start") {
        int n;
        cin >> n;
        H now;
        while (n--) {
            int x;
            cin >> x;
            now = now ^ H(x);
            cout << now.get() << '\n';
        }
        cout << out(now) << '\n';
    }
    else {
        string s;
        cin >> s;
        int n;
        cin >> n;
        H now = in(s);
        while (n--) {
            int x;
            cin >> x;
            now = now ^ H(x);
            cout << now.get() << '\n';
        }

    }

}