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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int q, a[100];

int ask() {
	inc(i, 100) {
		if(i != 0) { cout << " "; }
		if(a[i] != -1) { printf("%02d", a[i]); } else { cout << "??"; }
	}
	cout << endl;
	
	int x, y, z;
	cin >> x >> y >> z;
	
	return z;
}

int g(int l, int r, int vl, int vr) {
	int m = (l + r) / 2;
	inc(i, 100) {
		a[i] = (inID(i, l, r) ? (i < m ? vl : vr) : -1);
	}
	
	return ask();
}

int h[100];
void f(int l, int r, vector<int> & v) {
	int n = v.size();
	if(n == 0) { return; }
	if(n == 1) { a[v[0]] = l; return; }
	
	int gg;
	if(n % 2 == 1) {
		gg = g(l, r, v[0], -1);
		h[v[0]] = (gg == 1 ? 0 : 1);
	}
	incID(i, n % 2, n) {
		gg = g(l, r, v[i], v[i + 1]);
		if(gg == 2) { h[v[i]] = 0; h[v[i + 1]] = 1; }
		if(gg == 0) { h[v[i]] = 1; h[v[i + 1]] = 0; }
		if(gg == 1) {
			gg = g(l, r, v[i], -1);
			h[v[i]] = h[v[i + 1]] = (gg == 1 ? 0 : 1);
		}
		
		i++;
	}
	
	vector<int> w[2];
	inc(i, n) { w[h[v[i]]].PB(v[i]); }
	
	int m = (l + r) / 2;
	f(l, m, w[0]);
	f(m, r, w[1]); 
}

int main() {
	cin >> q;
	
	vector<int> v;
	inc(i, 100) { v.PB(i); }
	f(0, 100, v);
	ask();
	
	return 0;
}