#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> p11;
typedef pair<string, int> ps1;
typedef pair<ll, ll> p1111;
#define vv vector
#define pb emplace_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fi first
#define se second
#define endl '\n'
#define Endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define per(a, b, c) for(int a = (b); a <= (c); a ++)
#define rep(a, b, c) for(int a = (b); a >= (c); a --)
#define aper(A) for(auto i : A) cout << i << ' ';cout << '\n'
#define lowbit(x) ((x) & (-x))
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define PAI acos(-1)
// #define int long long
using ll = long long;
void umin(int &x,int y){if(x>y)x=y;}
void umax(int &x,int y){if(x<y)x=y;}

void pre_work()
{
}

void solve()
{
    double a, b;
    cin >> a >> b;
    vv<int> ans;
    int n = 25;
    while(n -- )
    {
        ans.pb(b * 2 >= 1);
        b *= 2;
        if(b >= 1) b -= 1;
    }
    for(int i = 0; i < 24; i ++)
        cout << 1;
    for(int i = 24; i >= 0; i --)
    {
        if(ans[i] == 1)
            cout << 2;
        else cout << 1;
    }
}

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