#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

const int N = 10;
int compare(const char *s, const char *t) {
	int r = 0;
	rep(i, N)
		r += s[i] == t[i];
	return r;
}

string secretans;
int queries = 0;
int query(const char *s) {
	++ queries;
#ifdef MY_LOCAL_RUN
	int X = compare(s, secretans.c_str());
	cerr << s << ": " << X << endl;
#else
	puts(s);
	fflush(stdout);
	int X;
	scanf("%d %*s", &X);
#endif
	if(X == N) {
//		cerr << "total " << queries << " queries" << endl;
		exit(0);
	}
	return X;
}


int main() {
#ifdef MY_LOCAL_RUN
	srand((unsigned)clock());
	secretans.resize(N);
	rep(i, N)
		secretans[i] = '0' + rand() % 10;
#endif
	string a;
	rep(k, 10) {
		string s(N, '0' + k);
		int x = query(s.c_str());
		rep(i, x)
			a += char('0' + k);
	}
	random_shuffle(all(a));
	string q1 = a;
	int X1 = query(q1.c_str());
	vector<string> v;
	sort(all(a));
	do {
		int cnt1 = compare(q1.c_str(), a.c_str());
		if(cnt1 == X1)
			v.push_back(a);
	} while(next_permutation(all(a)));
	while(1) {
		string q = v[rand() % v.size()];
		int X = query(q.c_str());
		v.erase(remove_if(all(v), [&q, X](const string &s) {
			return compare(q.c_str(), s.c_str()) != X;
		}), v.end());
	}
	return 0;
}