import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum N = 10;

debug {
  string S;
}

int Ask(int[] xs) {
  int ret;
  debug {
    foreach (i; 0 .. N) {
      if (S[i] - '0' == xs[i]) {
        ++ret;
      }
    }
  } else {
    foreach (i; 0 .. N) {
      write(xs[i]);
    }
    writeln();
    stdout.flush;
    ret = readInt();
    readToken();
  }
  if (ret == N) {
    import core.stdc.stdlib;
    exit(0);
  }
  return ret;
}

void main() {
  debug {
    S = readToken();
  }
  
  auto xs = new int[N];
  foreach (i; 0 .. N) {
    int mx = -1;
    int am = xs[i];
    foreach (a; 0 .. N) {
      xs[i] = a;
      const res = Ask(xs);
      if (chmax(mx, res)) {
        am = a;
      }
    }
    xs[i] = am;
  }
  assert(false);
}