#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int mod = 998244353;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    double a,b;
    cin>>a>>b;
    queue<double>q;
    q.push(a);
    set<double>st;
    st.insert(a);
    double ans=0;
    map<pair<double,double>,int>mp;
    while(!q.empty())
    {
        double x=q.front();
        q.pop();
        if(abs(x-b)<=0.0001)
        {
            ans=x;
            break;
        }
        double tmp=x;
        tmp/=2;
        if(st.count(tmp)==0)
        {
            mp[{x,tmp}]=1;
            st.insert(tmp);
            q.push(tmp);
        }
        tmp+=(double)0.5;
        if(st.count(tmp)==0)
        {
            mp[{x,tmp}]=2;
            st.insert(tmp);
            q.push(tmp);
        }
    }
    // cout<<ans<<endl;
    vector<int>v;
    // cout<<mp[{0.5,0.75}]<<endl;
    int x=50;
    // cout<<ans*2<<" "<<ans*2-1<<" "<<ans<<endl;
    while(ans!=a)
    {
        // cout<<ans*2<<" "<<ans*2-1<<" "<<ans<<endl;
        // cout<<mp[{ans*2,ans}]<<" "<<mp[{(2*ans-1),ans}]<<endl;
        if(mp[{ans*2,ans}]==1)
        {
            ans*=2;
            v.push_back(1);
        }
        else if(mp[{(2*ans-1),ans}]==2)
        {
            ans=2*ans-1;
            v.push_back(2);
        }
    }
    reverse(v.begin(),v.end());
    for(auto i:v)
    {
        cout<<i;
    }

    return 0;
}