//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#ifdef __APPLE__

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#if __APPLE__
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define D while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int sum_min = 0;

bool DBG = false;

string S, SS;

void prepare() {
    string s;
    if(DBG) {
        for(int i = 0; i < 25; i++) { s += (char)(i + 'A'); s += (char)(i + 'A'); }
        shuffle(all(s), rng);
        cout << s << endl;
        S = s;
    } else cin >> s;
    vector<vector<int> > a(len(s) + 1);
    for(int i = 0; i < len(s); i++)
        for(int j = i + 1; j < len(s); j++)
            if(s[i] == s[j])
                a[i].pb(j);
    vector<int> dp(len(s) + 1, -1);
    vector<pair<int, int> > pr(len(s) + 1);
    dp[0] = 0;
    for(int i = 0; i <= len(s); i++) {
        if(i && umax(dp[i], dp[i - 1])) {
            pr[i] = {0, i - 1};
        }
        for(auto& to : a[i])
            if(umax(dp[to + 1], dp[i] + 1)) {
                pr[to + 1] = {1, i};
            }
    }
    string ans = string(len(s), '0');
    int cpos = len(s);
    while(cpos) {
        int from = pr[cpos].se;
        int type = pr[cpos].fi;
        if(type) {
            ans[from] = ans[cpos - 1] = '1';
        }
        cpos = from;
    }
//    for(int i = 0; i < s.size(); i++) ans += char('0' + (s[i] <= 'L'));
    cout << ans << endl;
    SS = ans;
}

void play() {
    int ammin = 0;
    string s;
    if(DBG) {
        s = SS;
    } else cin >> s;
    vector<int> pos[2];
    for(int i = 0; i < len(s); i++)
        pos[s[i] - '0'].pb(i);
    for(int it = 0; it < 1; it++) {
        map<char, int> done;
        vector<pair<int, int> > to_do;
        while(!pos[it].empty()) {
            auto A = pos[it].back(); pos[it].pop_back();
            cout << A + 1 << endl;
            if(DBG) {
                cout << S[A] << endl;
            }
            char out;
            char c;
            if(DBG) {
                c = S[A];
                out = '.';
            } else cin >> c >> out;
            if(done.count(c)) {
                cout << done[c] + 1 << endl;
                if(DBG) {
                    cout << S[done[c]] << endl;
                }
                char out1, out2;
                if(DBG) {
                    out1 = c;
                    out2 = '+';
                } else cin >> out1 >> out2;
                done.erase(c);
            } else {
                done[c] = A;
                auto B = pos[it].back(); pos[it].pop_back();
                cout << B + 1 << endl;
                if(DBG) {
                    cout << S[B] << endl;
                }
                char c2, out2;
                if(DBG) {
                    c2 = S[B];
                    out2 = (c == c2 ? '+' : '-');
                } else cin >> c2 >> out2;
                ammin += (out2 == '-');
                if(done.count(c2)) {
                    if(c2 != c) to_do.pb({B, done[c2]});
                    done.erase(c2);
                } else done[c2] = B;
            }
        }
        for(auto& x : to_do) {
            cout << x.fi + 1 << endl;
            if(DBG) {
                cout << S[x.fi] << endl;
            }
            char out1, out2, out3, out4;
            if(DBG) {
                out1 = S[x.fi]; out2 = '.';
            } else cin >> out1 >> out2;
            cout << x.se + 1 << endl;
            if(DBG) {
                cout << S[x.se] << endl;
            }
            if(DBG) {
                out3 = S[x.se]; out4 = '+';
            } else cin >> out3 >> out4;
        }
    }
    for(int i = 0; i < len(pos[1]); i += 2) {
        cout << pos[1][i] + 1 << endl;
        string ssss; cin >> ssss;
        cout << pos[1][i + 1] + 1 << endl;
        cin >> ssss;
    }
    if(DBG) cout << ammin << '\n';
    sum_min += ammin;
}

signed main() {
//   freopen("input.txt", "r", stdin);
//   freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(DBG) {
        int t = 100;
        while(t--) {
            prepare();
            play();
        }
        cout << sum_min << '\n';
        return 0;
    }

    string mode; cin >> mode;

    int t = 1;

    cin >> t;

    while (t--) {
        if(mode == "prepare") prepare();
        else play();
    }

}

/*
KIVI
*/