#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 500;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

modint t10[1000];
modint f[300];
void init() {
	t10[0] = 1;
	rep1(i, 900) {
		t10[i] = t10[i - 1] * (modint)10;
	}
	f[0] = 1;
	rep1(i, 200) {
		rep(j, i + 1) {
			f[i] += fact[j] * comb(i, j);
		}
	}
}

int r(int &x) {
	string s = to_string(x); return (int)s.size();
}

modint calc(vector<int> &a) {
	int n = a.size();
	modint dp[205][805] = {};
	modint cop[205][805] = {};
	dp[0][0] = 1;
	rep(i, n) {
		int d = r(a[i]);
		per(j, i + 1) {
			per(k, 4 * i + 1) {
				dp[j + 1][k + d] += dp[j][k];
			}
		}
	}
	modint ans = 0;
	rep(i, n) {
		rep(j, n + 1)rep(k, 4 * n + 1)cop[j][k] = 0;
		int d = r(a[i]);
		per(j, n) {
			per(k, 4*(n-1)+1) {
				cop[j][k] = dp[j + 1][k + d] - cop[j + 1][k + d];
				ans += (modint)a[i]*cop[j][k] * f[n - 1 - j] * fact[j] * t10[k];
			}
		}
	}
	return ans;
}
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	modint ans = calc(a);
	int cnt = 0;
	rep(i, n)if (a[i] == 0)cnt++;
	if (cnt > 0) {
		rep(i, n)if (a[i] == 0) {
			a.erase(a.begin() + i);
			break;
		}
		modint sub = calc(a);
		sub = sub * (modint)cnt;
		ans -= sub;
	}
	cout << ans << endl;
	
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	init_f(); init();
	//int t; cin >> t; rep(i, t)solve();
	//while (cin >>n>>m>>s>>t, n)solve();
	solve();
	stop
		return 0;
}



Measured memory_bytes: 5892