import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum B = 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto C = new int[B];
      foreach (x; 1 .. B) {
        C[x] = readInt();
      }
      
      int[] xs;
      foreach (x; 1 .. B) {
        foreach (_; 0 .. C[x]) {
          xs ~= x;
        }
      }
      assert(xs.length == N);
      
      const half = N / 2;
      long ten = 1;
      foreach (_; 0 .. half) {
        ten *= 10;
      }
      
      auto yss = new long[][][](2, 1 << N);
      void dfs(int s, int pos, int used, long y) {
        if (pos == (s ? (N - half) : half)) {
          yss[s][used] ~= y;
        } else {
          foreach (u; 0 .. N) {
            if (!(used & 1 << u)) {
              if (s == 0 && u - 1 >= 0 && xs[u - 1] == xs[u] && !(used & 1 << (u - 1))) continue;
              if (s == 1 && u + 1 < N && xs[u] == xs[u + 1] && !(used & 1 << (u + 1))) continue;
              dfs(s, pos + 1, used | 1 << u, y * 10 + xs[u]);
            }
          }
        }
      }
      dfs(0, 0, 0, 0);
      dfs(1, 0, 0, 0);
      foreach (p; 0 .. 1 << N) {
        yss[0][p] = yss[0][p].sort.uniq.array;
      }
      foreach (q; 0 .. 1 << N) {
        yss[1][q] = yss[1][q].sort.uniq.array;
        foreach (ref y; yss[1][q]) {
          y *= -ten;
        }
      }
      
      bool check(int e) {
        const mask = (1L << e) - 1;
        foreach (p; 0 .. 1 << N) {
          const q = ((1 << N) - 1) ^ p;
          auto ys0 = yss[0][p].dup;
          auto ys1 = yss[1][q].dup;
          foreach (ref y; ys0) y &= mask;
          foreach (ref y; ys1) y &= mask;
          ys0 = ys0.sort.uniq.array;
          ys1 = ys1.sort.uniq.array;
          const len = cast(int)(ys0.length);
          int pos;
          foreach (y; ys1) {
            for (; pos < len && ys0[pos] < y; ++pos) {}
            if (pos < len && ys0[pos] == y) {
              return true;
            }
          }
        }
        return false;
      }
      
      int lo = 0, hi = 47;
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        (check(mid) ? lo : hi) = mid;
      }
      writeln(lo);
    }
  } catch (EOFException e) {
  }
}