#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5+7,mod=1e9+7,INF=1e18;


double quai(double a,ll b){
	double ans=1;
	while(b){
		if(b&1) ans=ans*a;
		a=a*a;
		b>>=1;
	}
	return ans;
}

void solve(){
	double a,b;
	cin>>a>>b;
//	double a1=a;
	a=quai(0.5,22)*a;
	vector<ll> vis(23);
	for(ll i=1;i<=22;i++){
		if(a+quai(0.5,i)<=b){
			a+=quai(0.5,i);
			vis[i]=2;
		}else{
			vis[i]=1;
		}
	}
	
	for(ll i=22;i>=1;i--){
//		if(vis[i]==2) a1=0.5*a1+0.5;
//		else a1=0.5*a1;
		cout<<vis[i];
	}
	cout<<endl;
//	cout<<a1<<endl;

}
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	
	cout << fixed << setprecision(10);
	
	ll T=1;
//    cin>>T;
    while(T--){
        solve();
    }
	return 0;
}