#include<bits/stdc++.h>
using namespace std;
#define p 1e-4

struct Node{
    double num;
    string s;
    bool operator<(const Node&b)const{
        return num<b.num;
    }
};

double a,b;
map<double,bool> mp;

int main() {
    cin>>a>>b;
    
    queue<Node> q;
    q.push({a});
    mp[a]=true;
    while(!q.empty()){
        Node now=q.front();q.pop();
        mp[now.num]=true;
        if(abs(now.num-b)<p){
            cout<<now.s<<endl;
            break;
        }
        if(!mp[now.num/2]){
            q.push({now.num/2,now.s+'1'});
            mp[now.num/2]=true;
        }
        if(!mp[(now.num-1)/2+1]){
            q.push({1-now.num/2,now.s+'2'});
            mp[1-now.num/2]=true;
        }
    }
    
    
    return 0;
}