#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N = 5e05+10;
const LL mod = 1e09+7;
const int inf = 0x3f3f3f3f;
const LL llinf = 5e18;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >mi;//小根堆
priority_queue<LL> ma;//大根堆
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
int n , m;
vector<int>a(N , 0);
void init(int n){
	for(int i = 0 ; i <= n ; i ++){
		a[i] = 0;
	}
}
void solve() 
{
	double a , b;
	cin >> a >> b;
	if(b == 0){
		for(int i = 1 ; i <= 50 ; i ++){
			cout << 1;
		}
	}
	//A + 1 = 0.5A
	//A = 0.5A
	//若第i步选2，等效于将在原式子基础上+( 1 << (i - 1) )
	//结果 = A >> k
	for(int i = 1 ; i <= 50 ; i ++){
		b *= 2;
		if(b * 2 > inf){
			b = (LL)b;
			vector<int>ops(i + 5 , 1);
			for(int j = 0 ; j < i ; j ++){
				if( ((LL)b >> j) & 1){
					ops[j] = 2;
				}
			}
			for(int j = 0 ; j < i ; j ++){
				cout << ops[j];
			}
			break;
		}
	}
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
//	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}