#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
const long double PI = acos(-1);
const ll mod = 998244353;
const int maxn = 1e6 + 7;
const int P = 13331;

ll qgcd(ll a, ll b) {
    return b == 0 ? a : qgcd(b, a % b);
}

ll qpow(ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1)
            ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans % mod;
}

double a, b;
int x, y;
int d[maxn];
vector<int> v;
int flag;

void dfs(int z) {
	if (d[z])
		return;
	d[z] = 1;
	if (z == y) {
		for (auto i: v) {
			cout << i;
		}
		flag = 1;
	}
	if (flag)
		return;
	if (d[z / 2] == 0 && v.size() < 50) {
		v.push_back(1);
		dfs(z / 2);
		v.pop_back();
	}
		
	if (flag == 0 && d[(z - 1000000) / 2 + 1000000] == 0 && v.size() < 50) {
		v.push_back(2);
		dfs((z - 1000000) / 2 + 1000000);
		v.pop_back();
	}
}

void solve() {
	cin >> a >> b;
	x = a * 1000000;
	y = b * 1000000;
	dfs(x);
}

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

/*

*/