#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(1) {
        ll n;
        cin >> n;
        if(!n) break;
        string str;
        cin >> str;

        // 仮数部
        ll a = 1;
        REP(i, 52) {
            a *= 2;
            a += str[i]-'0';
        }

        // cout << "a=" << bitset<53>(a) << endl;
        // {
        //     ll e = 0, s = a;
        //     REP(i, n) {
        //         // s += a
        //         s += a;
        //         if(s >= 1LL<<53) {
        //             e++;
        //             s >>= 1;
        //             a >>= 1;
        //         }
        //         cout << bitset<53>(s) << " " << e << endl;
        //         cout << bitset<12>(e) << bitset<52>(s) << endl;
        //     }
        //
        //     cout << bitset<12>(e) << bitset<52>(s) << endl;
        // }

        {
            ll e = 0, s = a;
            // cout << e << " " << bitset<53>(s) << " " << bitset<53>(a) << endl;
            while(1) {
                ll cnt = a==0?LLINF:((1LL<<53) - s + a - 1) / a;
                if(n >= cnt) {
                    n -= cnt;
                    s += a * cnt;
                    e++;
                    s >>= 1;
                    a >>= 1;
                } else {
                    s += a * n;
                    // cout << e << " " << bitset<53>(s) << " " << bitset<53>(a) << " " << cnt << endl;
                    break;
                }
                // cout << e << " " << bitset<53>(s) << " " << bitset<53>(a) << " " << cnt << endl;
            }

            cout << bitset<12>(e) << bitset<52>(s) << endl;
        }
    }


    return 0;
}



Measured memory_bytes: 3028