#include <iostream>
#include <stack>

using namespace std;

int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    int K;
    cin >> K;
    long long index = 0;
    while (K--) {
        int L;
        cin >> L;
        switch (L) {
            case 0: index = 2 * index + 1; break;
            case 1: index = 2 * index + 2; break;
            case 2: index = (index - 1) / 2; break;
            case 3: --index; break;
            case 4: ++index; break;
        }
    }
    int row = 0, current = 0;
    while (2 * current + 1 <= index) {
        current = 2 * current + 1;
        ++row;
    }
    cout << row << '\n';
    index -= current;
    if (index == 0) {
        cout << "0\n";
        return 0;
    }
    stack<int> digitS;
    while (index) {
        digitS.push(index % 2);
        index /= 2;
    }
    while (!digitS.empty()) {
        cout << digitS.top();
        digitS.pop();
    }
    cout << '\n';
}