#include <bits/stdc++.h>
using namespace std;

void kivonas(deque<int> &q) {
    int cnt = 0;
    while(true) {
        auto t = q.begin();
        q.pop_front();
        if (*t > 0) {
            q.push_front(*t-1);
            while(cnt--) {
                q.push_front(2);
            }
            return;
        } else {
            cnt++;
        }
    }
}

void hozzaad(deque<int> &q) {
    int cnt = 0;
    while(true) {
        auto t = q.begin();
        q.pop_front();
        if (*t < 2) {
            q.push_front(*t+1);
            while(cnt--) {
                q.push_front(0);
            }
            return;
        } else {
            cnt++;
        }
    }
}

int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n;
    cin >> n;
    vector<int> a(n);

    int sum = 0;
    for(int &i : a) {
        cin >> i;
    }

    int sor = 0;
    deque<int> q;

    for(int i = 0; i < n; ++i) {
        if (a[i] == 0) {
            ++sor;
            q.push_front(0);
        } else if (a[i] == 1) {
            ++sor;
           q.push_front(1);
        } else if (a[i] == 2) {
            ++sor;
            q.push_front(2);
        } else if (a[i] == 3) {
            --sor;
            q.pop_front();
        } else if (a[i] == 4) {
            kivonas(q);
        } else if (a[i] == 5) {
            hozzaad(q);
        }
    }

    cout << sor << '\n';

    bool OK = false;

    for(auto it = q.rbegin(); it != q.rend(); ++it) {
        if (*it > 0) OK = 1;
        if (OK) cout << *it;
    }
    if (!OK) cout << 0 << '\n';

	return 0;
}