#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
double a,b;
int pre[2000000];
bool vis[2000000];
int s,t;
void bfs(){
	queue<int> q;q.push(s);vis[s]=true;
	while(true){
		int x = q.front();q.pop();
		//cout<<x<<"pre = "<<pre[x]<<"\n";
		if(abs(x-t)<=10){
			t=x;
			return;
		}
		if(!vis[x/2]){
			vis[x/2]=true;
			q.push(x/2);
			pre[x/2]=x;
		}
		if(!vis[x/2+50000]){
			vis[x/2+50000]=true;
			q.push(x/2+50000);
			pre[x/2+50000]=x;
		}
	}
}
void output(int x){
	if(x==s)  return ;
	output(pre[x]);
	if(pre[x]/2==x){
		cout<<"1";
	}else{
		cout<<"2";
	}
}
int main(){
	cin>>a>>b;
	s = a*100000,t = b*100000;
	bfs();
	output(t);
}