#include<bits/stdc++.h>
using namespace std;

#define ONLINE
#ifndef ONLINE
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

template<typename T>
inline T READ(){
	T x=0; bool f=0; char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=x*10+c-'0',c=getchar();
	return f?-x:x;
}
inline int read(){return READ<int>();}
inline LL readLL(){return READ<LL>();}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int main(){
	long double a,b;
	scanf("%Lf%Lf",&a,&b);
	vector<int>ans;
	for(int i=1;i<=50 && fabs(a-b)>1e-8;i++){
		if(fabs(b-0.5)<1e-8){
			if(a>0.5){
				ans.push_back(1);
				b=b*2;
			}
			else{
				ans.push_back(2);
				b=b*2-1;
			}
		}
		else if(b>0.5){
			ans.push_back(2);
			b=b*2-1;
		}
		else{
			ans.push_back(1);
			b=b*2;
		}
//		debug("%d|%.12Lf\n",i,b);
	}
	reverse(ans.begin(),ans.end());
	for(int x:ans) printf("%d",x);
//	debug("\n");
//	for(int x:ans){
//		if(x==1) a=a/2;
//		else a=(a+1)/2;
//		debug("%.12Lf\n",a);
//	}
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/