#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <cassert>
#include <numeric>

using namespace std;
typedef long long ll;

const long double eps = 1e-5;

bool eq(long double a, long double b) { return abs(a - b) < eps; } // ==
bool gt(long double a, long double b) { return a - b > eps; }      // >
bool lt(long double a, long double b) { return a - b < -eps; }     // <
bool ge(long double a, long double b) { return a - b > -eps; }     // >=
bool le(long double a, long double b) { return a - b < eps; }      // <=

void solve()
{
    long double a, b, s = 0.5;
    cin >> a >> b;

    string ans;
    for (int i = 0; i < 20; i ++)
        ans += '1', a = a * s;
    
    string bit;
    long double t = 0.5;
    for (int i = 0; i < 20; i ++)
    {
        if (ge(b, t)) bit += '2', b -= t;
        else bit += '1';
        t *= 0.5;
    }

    reverse(bit.begin(), bit.end());
    for (auto x : bit)
        if (x == '1') a *= s;
        else a = (a - 1) * s + 1;
    
    ans += bit;
    // cout << a << '\n';
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

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