/*DavitMarg*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <list>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
#ifndef death
#include "encoder.h"
#include "encoderlib.h"
#endif
#ifdef death
const int N = 100;
int X[N], L;
void send(int a)
{
X[L++] = a;
cout << "!send " << a << endl;
}
void output(int a)
{
cout << "!output " << a << endl;
}
#endif // death
void encode(int n, int x[])
{
srand(n);
int xr = rand()%256;
for (int i = 0; i < n; i++)
for (int j = 0; j < 8; j++)
if ((1 << j) & (x[i]^xr))
send(i * 8 + j);
}
#ifdef death
int main()
{
int nn, xx[N];
cin >> nn;
for (int i = 0; i < nn; i++)
cin >> xx[i];
encode(nn, xx);
decode(nn, L, X);
return 0;
}
#endif
/*
*/
/*DavitMarg*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <list>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
#ifndef death
#include "decoder.h"
#include "decoderlib.h"
#endif
#ifdef death
const int N = 100;
int X[N], L;
void send(int a)
{
X[L++] = a;
cout << "!send " << a << endl;
}
void output(int a)
{
cout << "!output " << a << endl;
}
#endif // death
void decode(int n,int l,int x[])
{
srand(n);
int xr = rand()%256;
vector<int> res(n);
for (int i = 0; i < l; i++)
{
int pos = x[i] / 8;
int add = x[i] % 8;
res[pos] += (1 << add);
}
for (int i = 0; i < n; i++)
output(res[i]^xr);
}
#ifdef death
int main()
{
int nn, xx[N];
cin >> nn;
for (int i = 0; i < nn; i++)
cin >> xx[i];
encode(nn, xx);
decode(nn, L, X);
return 0;
}
#endif
/*
*/
