#include<bits/stdc++.h>

using namespace std;

//int n;
const int N=1e7+10;
#define int long long 
const int mod=998244353;

int sum[N];
int fac[N],infac[N];
int n;

int qmi(int a,int b)
{
	int res=1ll;
	while(b)
	{
		if(b&1) res=res*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return res%mod;
}

void init()
{
	fac[0]=infac[0]=1ll;
	for(int i=1;i<=n;i++)
	{
		fac[i]=fac[i-1]*i%mod;
		infac[i]=infac[i-1]*qmi(i,mod-2)%mod;
	}
}

int C(int a,int b)
{
	return fac[b]*infac[a]%mod*infac[b-a]%mod;
}

string s;
bool f=0;
void dfs(double x,double y,string ss,int k)
{
	if(f) return;
	if(fabs(x-y)<=1e-4)
	{
		s=ss;
		f=1;
		return;
	}
	if(k==50) return;
	
	if(x>1e-4)
	dfs(x*0.5,y,ss+'1',k+1);
	
	if(1-x>1e-4)
	dfs(x*0.5+0.5,y,ss+'2',k+1);
}


void solve()
{
	double a,b;
	scanf("%lf%lf",&a,&b);
	string ss="";
	dfs(a,b,ss,0);
	cout<<s<<'\n';
	//cout<<s.size();
	//printf("%.4lf\n",a);
	
}
signed main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0),cout.tie(0);
	
	solve();
	return 0;
}