#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct coord { 
  ll x, y;
  ll n() { return pow(5,x) * pow(2,y); }
};
coord calc_coord(ll n) {
  ll nx = 0, ny = 0;
  while (n%5==0) { n/=5; nx++; }
  while (n%2==0) { n/=2; ny++; }
  return {nx,ny};
}

int main() {
  ll x1, x2; cin >> x1 >> x2;
  coord c1 = calc_coord(x1), c2;

  while (c1.x!=9) { 
    c1.x++; cout << c1.n() << endl; 
    if (c1.n()==x2) return 0;
    cin >> x2; if (c1.n()==x2) return 0;
  }
  while (c1.y!=7) {
    c1.y += c1.y<7 ? 1 : -1; cout << c1.n() << endl; 
    if (c1.n()==x2) return 0;
    cin >> x2; if (c1.n()==x2) return 0;
  }

  c2 = calc_coord(x2);
  if ((abs(c1.x-c2.x)+abs(c1.y-c2.y))%2==1) {
    rep(_,2) {
      c1.y++; cout << c1.n() << endl; 
      if (c1.n()==x2) return 0;
      cin >> x2; if (c1.n()==x2) return 0;
    }
  }
  else {
    c1.y = 9; cout << c1.n() << endl; 
    if (c1.n()==x2) return 0;
    cin >> x2; if (c1.n()==x2) return 0;
  }

  while (true) {
    c2 = calc_coord(x2);
    ll dx = c1.x-c2.x, dy = c1.y-c2.y;
    if (abs(dx)>=abs(dy)) c1.x += dx>0 ? -1 : 1;
    else c1.y += dy>0 ? -1 : 1;

    cout << c1.n() << endl; if (c1.n()==x2) return 0;
    cin >> x2; if (c1.n()==x2) return 0;
  }
  // cout << result << endl;
  return 0;
}