#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

void solve() {
	double a, b;
	cin >> a >> b;

	vector<int> path;
	auto dfs = [&](auto self, double n, int cnt) {
		if (abs(n - b) <= 1e-6) {
			for (int i = 0; i < (int)path.size(); ++ i) {
				cout << path[i];
			}
			cout << "\n";
			exit(0);
		}
		if (cnt > 50) {
			return;
		}
		path.push_back(1);
		self(self, n / 2, cnt + 1);
		path.pop_back();
		path.push_back(2);
		self(self, n / 2 + 0.5, cnt + 1);
		path.pop_back();
	};
	dfs(dfs, a, 1);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	solve();

	return 0;
}