#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



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%4);
	}
	
	if(!S.count(1)&&!S.count(3)){
		ans *= 2;
		bool f = true;
		rep(i,10){
			rep(j,10){
				if(c[i]>0&&c[j]>0){
					long long tt = 0;
					if(i==0){
						if(c[i]>=2){
							tt = i*10 + j;
						}
					}
					else{
						tt = i*10+j;
					}
					if(tt%4!=0){
						f=false;
					}
				}
			}
		}
		if(f)ans *= 2;
		rep(i,10){
			c[i]--;
			rep(j,10){
				c[j]--;
				rep(k,10){
					c[k]--;
					if(c[i]>=0&&c[j]>=0&&c[j]>=0){
						long long tt = 0;
						tt += k;
						tt *= 10;
						tt += j;
						tt *= 10;
						tt += i;
						tt %= 8;
						if(tt!=0)f = false;
					}
					c[k]++;
				}
				c[j]++;
				
			}
			c[i]++;
		}
		if(f)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;
			}
		}
	}
	long long temp = 0;
	rep(i,10){
		long long t2 = pow_mod(10,c[i],7);
		temp *= t2;
		t2--;
		if(t2<0)t2 += 7;
		t2 *= inv_mod(9,7);
		t2 %= 7;
		
		t2 *= i;
		t2 %= 7;
		temp += t2;
		temp %= 7;
	}
	if(temp==0&&f)ans *= 7;
		
	
	cout<<ans.val()<<endl;
	
	return 0;
}