#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

string nulla_nelkul(long long x) {
    if (x == 0) return "0";
    string s;
    while (x > 0) {
        s.push_back('0' + (x % 3));
        x /= 3;
    }
    reverse(s.begin(), s.end());
    return s;
}

int main() {
    int K;
    cin >> K;

    long long sor = 0;   
    long long i = 0;

    for (int k = 0; k < K; k++) {
        int step;
        cin >> step;

        if (step == 0) { // balra le
            i = 3 * i;
            sor++;
        }
        else if (step == 1) { // középre le
            i = 3 * i + 1;
            sor++;
        }
        else if (step == 2) {// jobbra le
            i = 3 * i + 2;
            sor++;
        }
        else if (step == 3) {// fel
            i /= 3;
            sor--;
        }
        else if (step == 4) { // balra
            i--;
        }
        else if (step == 5) {// jobbra
            i++;
        }
    }

    cout << sor << "\n";
    cout << nulla_nelkul(i) << "\n";
}