// Created by Armin on 1/12/2025.
// See on https://njudge.hu/problemset/main/NT23_Tablajatek2/

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pp = pair<int, int>;

void convertToTernary(ll n) {
  if (n == 0) return;
  const ll x = n % 3;
  n /= 3;
  if (x < 0) n++;
  convertToTernary(n);
  cout << x;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    
    int n; cin >> n;
    ll i = 0, j = 0;
    for (int k = 0; k < n; k++) {
        int x; cin >> x;
        if (x == 0) {
          i++;
          j *= 3;
        } else if (x == 1) {
          i++;
          j = 3*j+1;
        } else if (x == 2) {
          i++;
          j = 3*j+2;
        } else if (x == 3) {
          i--;
          j /= 3;
        } else if (x == 4) {
          j--;
        } else if (x == 5) {
          j++;
        }
    }
    cout << i << '\n';
    convertToTernary(j);
    
    return 0;
}