#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
double a,b,ms=0.5,esp=1e-4;
int ma=51;
unordered_map<double,int > mp;
struct node{
	int v;
	double c;
	string s;
	node(string ss,double cc,int vv){
		s=ss;
		c=cc;
		v=vv;
	}
};
int main(){
	cin>>a>>b;
	queue<node> q;
	string cs="";
	q.push(node(cs,a,0));
//	cout<<esp<<endl;
	while(!q.empty()){
		string s=q.front().s;
		double c=q.front().c;
		int v=q.front().v;
//		cout<<"s:"<<s<<" c:"<<c<<" v:"<<v<<endl;
		q.pop();
		if(fabs(c-b)<=esp){
			cout<<s<<endl;
			break;
		}
		string s1=s+"1";
		int nv=v+1;
		double nc=ms*c;
		if(mp.find(nc)==mp.end()||mp[nc]>nv){
			q.push(node(s1,nc,nv));
		}
		string s2=s+"2";
		nc=(c-1)*ms+1;
		if(mp.find(nc)==mp.end()||mp[nc]>nv){
			q.push(node(s2,nc,nv));
		}
	}
	
	return 0;
}