#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <random>
#include <climits>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
 
using namespace std;
 
#define endl '\n'
typedef long long ll;
#define int long long
//typedef __int128_t int128;
typedef pair<int, int> PII;
typedef pair<PII, int> PIII;
const int INF = 0x3f3f3f3f, mod = 998244353;
mt19937 rng(time(0));
#define x first
#define y second
#define lowbit(x) ((x) & -(x))
//#define double long double
const int N = 510;

ll n, m;



void solve() {
    
    double a, b;
    cin >> a >> b;
    vector<int> ans;
    b -= 1e-15;
    for (int i = 1; i <= 50; i ++ ) {
        int k = b * 2;
        b *= 2;
        b = b - (int)b;
        ans.push_back((k == 1 ? 2 : 1));
    }
    for (int i = ans.size() - 1; i >= 0; i -- ) {
        cout << ans[i];
        // if (ans[i] == 1) a = a * 0.5;
        // else a = a * 0.5 + 0.5;
    }
    //cout << endl << a << endl;
}
 
signed main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//     freopen("input.txt", "r", stdin);
//      freopen("output.txt", "w", stdout);
    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
      
    return 0;
}