#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<set>
#include<cstring>
#include<map>
#include<unordered_map>
#include<queue>

#define x first
#define y second
#define int long long 
#define fast ios::sync_with_stdio(false);cin.tie(0);
#define Endl endl
using namespace std;
const int N = 5e5 + 10;

void solve()
{
    double a,b;
    cin>>a>>b;
    
    string s;
    double tmp=0.5;
    string ans;
    while(abs(a)>1e-4)
    ans+='1',a/=2;
    
    swap(a,b);
    while(a>1e-4)
    {
        if(a>tmp||(abs(a-tmp)<=1e-4))
        {
            s.push_back('1');
            a-=tmp;
        }
        else
        s.push_back('0');
        tmp/=2;
    }

    for(int i=s.size()-1;i>=0;i--)
    if(s[i]=='1')
    ans+='2';
    else
    ans+='1';
    
    cout<<ans<<endl;
}

signed main()
{
    fast;
    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        solve();
    }
    return 0;
}