/* -*- coding: utf-8 -*-
 *
 * 1632.cc:  No.1632 Sorting Integers (GCD of M) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

int cs[10], prs[2];

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  ll csum = 0;
  int cn = 0;
  for (int i = 1; i <= 9; i++) {
    scanf("%d", cs + i);
    if (cs[i] > 0) {
      cn++;
      csum += (ll)i * cs[i];
      prs[i & 1]++;
    }
  }

  if (cn == 1) {
    int p =
      (ll)(powmod(10, n) + MOD - 1) % MOD *
      powmod(10 - 1, MOD - 2) % MOD;

    for (int i = 1; i <= 9; i++)
      if (cs[i] > 0) {
	p = (ll)p * i % MOD;
	break;
      }

    printf("%d\n", p);
    return 0;
  }

  int p = 1;
  if (prs[0] > 0 && prs[1] == 0) p *= 2;

  if (csum % 9 == 0) p *= 9;
  else if (csum % 3 == 0) p *= 3;

  printf("%d\n", p);
  return 0;
}