#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<deque>
#include<map>
#define x first
#define y second
#define ll long long
#define ULL unsigned long long
using namespace std;

typedef pair<int, int> PII;

const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const double s = 0.5, eps = 1e-4;
const int inf = 0x3f3f3f3f;

vector<int> anw;
double a, b;
bool f;

void dfs(double res, int cnt)
{
	if(f || cnt > 50) return;
	if(fabs(res - b) <= eps) 
	{
		f = 1;
		for(auto it : anw) cout << it;
		return;
	}
	anw.push_back(1);
	cnt ++;
	dfs(res * 0.5, cnt + 1);
	anw.pop_back();
	cnt --;
	
	anw.push_back(2);
	cnt ++;
	dfs(res * 0.5 + 0.5, cnt + 1);
	anw.pop_back();
	cnt --;
}

void solve()
{
	cin >> a >> b;
	dfs(a, 0);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	//cin >> t;
	t = 1;
	while(t -- )
		solve();
	return 0;
}