#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define int long long
#define inf 1e18
#define rep(i, l, n) for (int  i = l; i <= n; i++)
#define per(i, l, n) for (int  i = n; i >= l; i--)
//cout<<fixed<<setprecision(15)
const int mol=998244353;
const int N = 3e5+10,M=5010;
int qmi(int a,int k){int res=1;while(k){if(k&1)res=res*a%mol;a=a*a%mol;k>>=1;}return res;}
int inv(int x){return qmi(x%mol,mol-2);}
int n,m,q,k;
double c[100];
void solve()
{
  double a,b;
  cin>>a>>b;
  c[0]=0.5;
  rep(i,1,50)c[i]=c[i-1]*0.5;
  rep(i,1,50)
  {
    int j=i;
    double o=a;
    while(j--)o*=0.5;
    string ans="";
    rep(k,0,i-1)
    {
      if(o+c[k]<=b+1e-4)
      {
        o+=c[k];
        ans+='2';
      }
      else ans+='1';
    }
    if(fabs(o-b)<=1e-4)
    {
      reverse(ans.begin(),ans.end());
      cout<<ans<<endl;
      return ;
    }
  }
}
signed main()
{
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  int T = 1;
   //cin>>T;
  for (int i = 1; i <= T; i++)solve();
  return 0;
}