#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}
int powmod(int x, int y, int m) {
	int ret = 1;
	int pw = x;
	while (y) {
		if (1 & y) {
			ret *= pw;
			ret %= m;
		}
		pw *= pw;
		pw %= m;
		y /= 2;
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>v(10);
	int c = 0;
	rep2(i, 1, 10) {
		cin >> v[i];
		if (v[i])c++;
	}
	if (1 == c) {
		rep(i, 10) {
			if (0 == v[i])continue;
			mint ans = (mint(10).pow(n) - 1)*i * inv_mod(9, mod);
			cout << ans.val() << endl;
		}
		return 0;
	}
	int g = 0;
	rep(i, 10) rep2(j, i + 1, 10) {
		if (0 == v[i])continue;
		if (0 == v[j])continue;
		g = gcd(g, j - i);
	}
	g *= 9;
	int g1 = 0;
	int x = 0;
	rep(i, 10) {
		int a = (powmod(10, v[i], 9 * g) - 1 + 9 * g) * i % (9 * g) / 9;
		int b = powmod(10, x, g);
		g1 += a * b;
		g1 %= g;
		x += v[i];
	}
	g = gcd(g, g1);
	cout << g << endl;
	return 0;
}