#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

pair<int,int> f(int a){
	int c=0,b=0;
	while(a%2==0) a/=2,c++;
	while(a%2==0) a/=5,b++;
	return {c,b};
}

int f(pair<int,int> a){
	int x=1;
	while(a.first) x*=2,a.first--;
	while(a.second) x*=5,a.second--;
	return x;
}

int dist(pair<int,int> S,pair<int,int> T){
	return abs(S.first-T.first)+abs(S.second-T.second);
}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int x,y;
	cin>>x>>y;
	auto S=f(x);
	auto T=f(y);
	while(f(S)!=(int)(1e9)/4){
		if(dist(S,T)==1){
			cout<<f(T)<<endl;
			return;
		}
		if(S.second!=9) S.second++;
		else if(S.first<7) S.first++;
		else if(S.first>7) S.first--;
		cout<<f(S)<<endl;
		cin>>y;
		T=f(y);
		if(S==T){
			return;
		}
	}
	int J=0;
	if(dist(S,T)%2==0){
		S.first=9;
		J=1;
		cout<<f(S)<<endl;
	}
	else if(dist(S,T)==1){
		S=T;
		cout<<f(T)<<endl;
		J=1;
	}
	if(S==T){
		return;
	}
	if(J) cin>>y,T=f(y);
	while(true){
		if(S.first>T.first){
			S.first--;
		}else if(S.first<T.first) S.first++;
		else if(S.second<T.second) S.second++;
		else if(S.second>T.second) S.second--;
		cout<<f(S)<<endl;
		if(S==T) return;
		cin>>y;
		T=f(y);
	}
}