#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int Q;
string S[100];
string T[100];

vector<int> ask() {
	int i;
	FOR(i,100) {
		cout<<T[i];
		if(i!=100) cout<<" ";
	}
	cout<<endl;
	vector<int> V(3);
	cin>>V[0]>>V[1]>>V[2];
	if(V[2]==100) exit(0);
	return V;
}

void solve(int id,int num,int L,int R,int tot) {
	if(tot==0) return;
	if(L+1==R) {
		if(tot) T[L][id]=num+'0';
		return;
	}
	int M=(L+R)/2;
	int i;
	FOR(i,100) S[i]="??";
	for(i=L;i<M;i++) S[i][id]='0'+num;
	auto ret=ask();
	int lp=ret[2],rp=tot-lp;
	
	solve(id,num,L,M,lp);
	solve(id,num,M,R,rp);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>Q;
	assert(Q>=600);
	FOR(i,100) S[i]=T[i]="??";
	
	FOR(i,2) {
		FOR(j,9) {
			solve(i,j,0,100,10);
		}
		FOR(j,100) if(T[j][i]=='?') T[j][i]='9';
	}
	
	x=0;
	FOR(i,100) x+=(T[i][0]=='?')+(T[i][1]=='?');
	FOR(i,100) S[i]=T[i];
	ask();
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}