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

using i64 = long long;

int __OneWan_2024 = [](){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    return 0;
}();
int dist[50005];
array<int, 2> pre[50005];
int main() {
    double a, b;
    cin >> a >> b;
    int ta = a * 20000, tb = b * 20000;
    fill(dist, dist + 50005, 200);
    dist[ta] = 0;
    queue<int> que;
    que.push(ta);
    pre[ta] = {-1, -1};
    while (!que.empty()) {
        int x = que.front();
        que.pop();
        {
            int tx = x * 0.5;
            if (dist[tx] > dist[x] + 1) {
                dist[tx] = dist[x] + 1;
                pre[tx] = {x, 1};
                que.push(tx);
            }
        }
        {
            int tx = (x + 10000);
            if (tx <= 50000) {
                if (dist[tx] > dist[x] + 1) {
                    dist[tx] = dist[x] + 1;
                    pre[tx] = {x, 2};
                    que.push(tx);
                }
            }
        }
    }
    vector<int> ans;
    int now = tb;
    while (pre[tb][0] != -1) {
        ans.push_back(pre[tb][1]);
        tb = pre[tb][0];
    }
    for (auto &x : ans) {
        cout << x;
    }
    return 0;
}