#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	string ans = "0000000000";
	bool done[10] = {};
	
	int before = -1;
	int last = 0;
	
	while (true) {
		printf("%s\n", ans.c_str());
		fflush(stdout);
		
		int now;
		string dummy;
		cin >> now >> dummy;
		if (now == 10) break;
		
		if (before == -1) {
			before = now;
		}
		else {
			if (before < now) last++;
			if (before > now) {
				ans[last] = (ans[last] - '0' - 1 + 10) % 10 + '0';
				last++;
				before++;
			}
			
			ans[last] = (ans[last] - '0' + 1) % 10 + '0';
		}
	}
	
	return 0;
}