#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
  #include "debug.hpp"
#else
  #define dbg(...) 0
#endif

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  const int N = 1000000;
  mt19937_64 rng(58);
  uniform_int_distribution<uint64_t> dist(0, numeric_limits<uint64_t>::max());
  vector<uint64_t> H(N);
  for (int i = 0; i < N; ++i) {
    H[i] = dist(rng);
  }
  vector<pair<uint64_t, int>> HH(N);
  for (int i = 0; i < N; ++i) {
    HH[i] = {H[i], i};
  }
  sort(HH.begin(), HH.end());
  auto check_one = [&](uint64_t x) -> int {
    auto it = lower_bound(HH.begin(), HH.end(), pair<uint64_t, int>(x, -1));
    if ((it == HH.end()) || (it->first != x)) return -1;
    return it->second;
  };
  uint64_t cur = 0;
  string s;
  cin >> s;
  bool is_resume = (s == "resume");
  if (is_resume) {
    string s2;
    cin >> s2;
    assert(int(s2.size()) == 64);
    for (int bi = 0; bi < 64; ++bi) {
      if (s2[bi] == '1') {
        cur |= uint64_t(1) << bi;
      }
    }
  }
  int n;
  cin >> n;
  while (n--) {
    int x;
    cin >> x;
    --x;
    cur ^= H[x];
    if (cur == 0) {
      cout << "0\n";
    }
    else if (int one = check_one(cur); one >= 0) {
      cout << (one + 1) << '\n';
    }
    else {
      cout << "-1\n";
    }
  }
  if (!is_resume) {
    for (int bi = 0; bi < 64; ++bi) {
      cout << ((cur >> bi) & 1);
    }
    cout << '\n';
  }
}