#include <bits/stdc++.h>
#define st first
#define nd second
#define db double
#define re register
#define pb push_back
#define mk make_pair
#define int long long
#define ldb long double
#define pii pair<int, int>
#define ull unsigned long long
#define mst(a, b) memset(a, b, sizeof(a))
using namespace std;
const int N = 1e6 + 10, lim = 1e6, mod = 998244353;
inline int read()
{
  int s = 0, w = 1;
  char ch = getchar();
  while(ch < '0' || ch > '9') { if(ch == '-') w *= -1; ch = getchar(); }
  while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * w;
}
string op;
ull id[N];
int n, s, c, k[N];
inline ull rnd() { return (ull)rand() * rand(); }
unordered_map<ull, int> mp;
inline void Sol(int fl)
{
  for(re int i = 1; i <= lim; i++) k[i] = 1;
  for(re int i = 1; i <= lim; i++) id[i] = rnd(), mp[id[i]] = i;
  if(fl){
    c = read();
    for(re int i = 1, x; i <= c; i++) x = read(), s += k[x] * id[x], k[x] *= -1;
  }
  n = read();
  while(n--){
    int x = read();
    s += k[x] * id[x], c += k[x], k[x] *= -1;
    if(!s) puts("0");
    else if(mp.find(s) != mp.end()) printf("%lld\n", mp[s]);
    else puts("-1");
  }
  if(!fl){
    printf("%lld  ", c);
    for(re int i = 1; i <= lim; i++) if(k[i] == -1) printf("%lld ", i);
  }
  
}
signed main()
{
  srand((unsigned)(time(0)));
  cin >> op;
  if(op == "start") Sol(0);
  else Sol(1);
  return 0;
}