#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for (int i=(n)-1;i>=0;i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define REPS(i,f,n) for (int i=(f)-1;i>=(n);i--)
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};

int memo;
int ans[11] = {0};

void memozero(void){


	rep(k, 10){
		printf("0");
	}
	printf("\n");

	int num;
	string s;
	cin >> num >> s;	
	memo = num;	

}

int main(void){
	memozero();

	rep(i, 11){//どこを変えるか
		reps(j, 1, 10){//変えている数字

			rep(k, i - 1){
				printf("0");
			}

			printf("%d", j);

			rep(l, 9 - i){
				printf("0");
			}

			printf("\n");

			int n;
			string s;
			cin >> n >> s;	
			
			if (n > memo)
				ans[i] = j;

		}	
	}


	rep(i, 11){
		printf("%d", ans[i]);
	}
	return 0;
}