#include<bits/stdc++.h>
using namespace std;
bool st[100010];
pair<int,int> pre[100010];
double a,b;

int get(double x)
{
    return (int)(x * 100000);
}

signed main(){
    scanf("%lf%lf",&a,&b);

    queue<double>q;
    st[get(a)] = true;
    q.push(a);
    int fir = get(a); 
    int id; 


    while(q.size())
    {
        double t = q.front();
        q.pop();
        int tid = get(t);
        if(fabs(t - b) <= 1e-4) 
        {
            id = get(t);
            //cout << id << '\n';
            break;
        }
        double s1 = t * 0.5;
        double s2 = t * 0.5 + 0.5;
        if(!st[get(s1)]) st[get(s1)] = true, q.push(s1), pre[get(s1)] = {tid, 1};
        if(!st[get(s2)]) st[get(s2)] = true, q.push(s2), pre[get(s2)] = {tid, 2};
    }

    vector<int>ans;
    while(id != fir)
    {
        auto c = pre[id];
        ans.push_back(c.second);
        id = c.first;
    }
    reverse(ans.begin(), ans.end());
    for(int x : ans) cout << x;
 
    cout << endl;
    //system("pause");
}