#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll mod =1e9+7;


int main(){
    string s="0000000000";
    cout<<"0000000000"<<endl;

    int now,idx=0,prev;
    string ok;
    cin>>now>>ok;
    if(ok=="unlocked") return 0;
    s[idx]++;
    cout<<s<<endl;
    prev=now;
    while(cin>>now>>ok){
        if(ok=="unlocked") break;
        if(prev==now) s[idx]++;
        else if(prev>now){
            s[idx]--;
            idx++;
            s[idx]++;
            now++;
        }
        else {
            idx++;
            s[idx]++;
        }
        prev = now;
        cout<<s<<endl;
    }
    return 0;
}