#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
// #define MOD 1000000007
#define MOD 1000000000000
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

template<class InputIterator>
void dump(InputIterator first,InputIterator last,char delim=' '){
	for(InputIterator it=first;it!=last;it++){
		if(it!=first)cout<<delim;
		cout<<*it;
	}
}

int q(string s){
	string k;
	int z;
	cout<<s<<endl;
	cin>>z>>k;
	if(z==10)exit(0);
	return z;
}
int main(void){
	int a[10];
	re(i,10){
		string s="";
		re(j,10)s+=i+'0';
		int k=q(s);
		a[i]=k;
	}
	string s="";
	re(i,10){
		re(j,a[i])s[j]+=i+'0';
	}
	sort(s.begin(),s.end());
	do{
		q(s);
	}while(next_permutation(s.begin(),s.end()));

	return 0;
}