#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
//#pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

/*
 *
 * notes:
 *
 * int64_t
 * stoi(string s) -> string to int
 * to_string() -> int (or else) to string
 *
 * vector declaration:
 * vector<ll> v(n, 0)
 * vector<vector<ll>> v(n, vector<ll>(n, 0));
 *
 * {if statement} ? {truth value} : {false value}
 *
 * set lower bound/upper bound:
 * 	// . . . m1 . . . d . . . . m2
 *    auto m1_it = b.lower_bound(d);
 *    advance(m1_it, -1);
 *    m1 = *m1_it;
 *	m2 = *b.upper_bound(d);
 *
 * #ifdef LOCAL
 *    freopen("in.txt","r",stdin);
 *    freopen("out.txt","w",stdout);
 * #endif
 *
 * constexpr auto lcm(auto x, auto... xs)
 * {
 *	return ((x = std::lcm(x, xs)), ...);
 * }
 *
 * std::gcd(int a, int b)
 *
 * cout << setprecision(n);
 *
 * set with custom ordering
 * set<ll, decltype(&cmp)> qu(cmp);
 *
 */

typedef int64_t ll;

bitset<505> b;

void mult2() {
    b <<= 1;
}

void div2() {
    b >>= 1;
}

void addone() {

    if(b[0] == 0) {

        b[0] = 1;

    }else{

        ll i = 0;
        while(1) {
            if(b[i] == 1) {
                b[i] = 0;
            }else{
                b[i] = 1;
                break;
            }
            i++;
        }

    }

}

void subone() {

    // megkeresi az elso egyest
    // es utana az osszest visszaallitja zerosra

    if(b[0] == 1) {
        b[0] = 0;
    }else{

        ll i = 0;
        while(1) {

            if(b[i] == 0) {
                b[i] = 1;
            }else{
                b[i] = 0;
                break;
            }
            i++;

        }

    }

}

void cerrr(ll lim) {

    for(ll i = 0; i < lim; i++) {
        cerr << b[i];
    }

}

void solve() {

    ll n;
    cin >> n;

    ll curry = 0;

    for(ll i = 0; i < n; i++) {
        ll op;
        cin >> op;

        //cerr << "\ni=" << i << "\nop=" << op;

        if(op == 0) {

            // balra le
            curry++;
            mult2();

        }else if(op == 1) {

            // jobbra le
            curry++;
            mult2();
            addone();

        }else if(op == 2) {

            // felfele
            curry--;
            div2();

        }else if(op == 3) {
            
            // balra
            subone();

        }else if(op == 4) {

            // jobbra
            addone();
        }

        
        //cerr << "\nb=";
        //cerr << b;
        //cerrr(8);
        //cerr << "\ncurry=" << curry << "; currx=" << currx;
    }

    cout << curry << "\n";
    bool show = false;

    for(ll i = 504; i >= 0; i--) {
        if(b[i] == 1 || i == 0) {
            show = true;
        }
        
        if(show) {
            cout << b[i];
        }
    }

}

int main()
{
    std::ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);

    solve();

    return 0;
}