#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 17;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

P trans(int x) {
	P res = { 0,0 };
	while (x % 2 == 0) {
		res.first++; x /= 2;
	}
	while (x % 5 == 0) {
		res.second++; x /= 2;
	}
	return res;
}
void out(int c2, int c5) {
	int res = 1; rep(i, c2)res *= 2; rep(i, c5)res *= 5;
	cout << res << endl; return;
}

int xs[4] = { 6,7,8,9 };
int ys[4] = { 9,8,9,9 };
void solve() {
	int x1, x2; cin >> x1 >> x2;
	int a[2] = {}, b[2] = {};
	P p = trans(x1);
	a[0] = p.first, a[1] = p.second;
	p = trans(x2);
	b[0] = p.first, b[1] = p.second;
	while (a[0] != 7) {
		if (a[0] > 7)a[0]--;
		else a[0]++;
		out(a[0], a[1]);
		if (a == b)return;
		int x; cin >> x;
		p = trans(x);
		b[0] = p.first, b[1] = p.second;
		if (a == b)return;
	}
	while (a[1] != 9) {
		a[1]++;
		out(a[0], a[1]);
		if (a == b)return;
		int x; cin >> x;
		p = trans(x);
		b[0] = p.first, b[1] = p.second;
		if (a == b)return;
	}
	rep(i, 4) {
		if (b[0] == xs[i] && b[1] == ys[i]) {
			out(b[0], b[1]); return;
		}
	}
	if ((b[0] + b[1]) % 2==0) {
		a[0] = a[1] = 9;
		out(a[0], a[1]);
		if (a == b)return;
		int x; cin >> x;
		p = trans(x);
		b[0] = p.first, b[1] = p.second;
		if (a == b)return;
	}
	while (true) {
		int dx = abs(a[0] - b[0]);
		int dy = abs(a[1] - b[1]);
		if (dx > dy) {
			if (a[0] < b[0])a[0]++;
			else a[0]--;
		}
		else {
			if (a[1] < b[1])a[1]++;
			else a[1]--;
		}
		out(a[0], a[1]);
		if (a == b)return;
		int x; cin >> x;
		p = trans(x);
		b[0] = p.first, b[1] = p.second;
		if (a == b)return;
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}