#include <bits/stdc++.h>
using namespace std;

const int N = 26, B = 1e4;

double a, b;
int st[20000], way[20000];

void dfs1 (double now, int step, int S) {
    // printf("> %lf %d %d\n", now, step, S);
    if (step >= 25) return;
    if (fabs(now - b) <= 0.0001) {
        // puts("A");
        for (int i = 0; i < step; i++)
            (S & (1 << i)) ? printf("2") : printf("1");
        exit(0);
    }
    if (step >= st[(int)(now * B)] && st[(int)(now * B)] != 0) return;
    st[(int)(now * B)] = step;
    way[(int)(now * B)] = S;
    dfs1(now / 2, step + 1, S);
    dfs1((now + 1) / 2, step + 1, S ^ (1 << step));
}

void dfs2 (double now, int step, int S) {
    if (step >= 25) return;
    if (st[(int)(now * B)] > 0) {
        // puts("B");
        for (int i = 0; i < st[(int)(now * B)]; i++)
            (way[(int)(now * B)] & (1 << i)) ? printf("2") : printf("1");
        for (int i = step - 1; i >= 0; i--)
            (S & (1 << i)) ? printf("2") : printf("1");
        exit(0);
    }
    if (now <= 0.5) dfs2(now * 2, step + 1, S);
    if (now >= 0.5) dfs2(now * 2 - 1, step + 1, S ^ (1 << step));
}

int main () {
    cin >> a >> b;
    dfs1(a, 0, 0);
    dfs2(b, 0, 0);
    return 0;
}