#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000005

bool get(vector<int> c,int m){
	long long temp = 0;
	rep(i,10){
		long long t2 = pow_mod(10,c[i],m);
		temp *= t2;
		t2--;
		if(t2<0)t2 += m;
		t2 *= inv_mod(9,m);
		t2 %= m;
		
		t2 *= i;
		t2 %= m;
		temp += t2;
		temp %= m;
	}
	return temp==0;
}

int main(){
	
	int N;
	cin>>N;
	
	vector<int> c(10,0);
	rep(i,9)cin>>c[i+1];
	
	rep(i,10){
		if(c[i]==N){
			mint ans = mint(10).pow(N);
			ans --;
			ans /= 9;
			ans *= i;
			cout<<ans.val()<<endl;
			return 0;
		}
	}
	
	long long sum = 0LL;
	rep(i,10){
		sum += (long long)i * c[i];
	}
	
	mint ans = 1;
	if(sum%3==0)ans *= 3;
	if(sum%9==0)ans *= 3;
	
	set<int> S;
	rep(i,10){
		if(c[i]>0)S.insert(i%2);
	}
	
	if(!S.count(1)){
		ans *= 2;
		bool f = true;
		rep(i,10){
			rep(j,10){
				if(c[i]>0&&c[j]>0){
					if(abs(i-j)%4!=0){
						f=  false;
					}
				}
			}
		}
		if(f&&get(c,4))ans *= 2;
		
	}
	
	bool f = true;
	rep(i,10){
		rep(j,10){
			if(c[i]>0&&c[j]>0){
				if(abs(i-j)%7!=0)f = false;
			}
		}
	}
	
	if(get(c,7)&&f)ans *= 7;
	
	f = true;
	rep(i,10){
		rep(j,10){
			if(c[i]>0&&c[j]>0){
				if(abs(i-j)%3!=0)f = false;
			}
		}
	}
	
	{
		long long sum = 0LL;
		rep(i,10){
			if(c[i]>12){
				long long temp = c[i];
				c[i] = 9 + c[i]%3;
				temp = temp-c[i];
				temp /= 3;
				sum += temp * (30*i);
			}
		}
		
		vector<long long> t;
		rep(i,10){
			rep(j,c[i])t.push_back(i);
		}
		while(t.size()%3!=0)t.push_back(0);
		reverse(t.begin(),t.end());
		while(t.size()>0){
		
			sum += t.back();
			t.pop_back();
			sum += t.back()*10;
			t.pop_back();
			sum += t.back()*19;
			t.pop_back();
		}
		if(sum%27!=0)f = false;
	}
	if(f)ans *= 3;
	
	cout<<ans.val()<<endl;
	
	return 0;
}