#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll n, a[100010], tmp[100] = {0, 1}, cnt[100], ans, col[100010];
unordered_map<ll, int> mp;
int check(ll x){
	if(mp[x])
		return mp[x];
	int cnt = 0;
	while(x > 0){
		x /= 10;
		cnt++;
	}
	return mp[x] = cnt;
}
int main(){
	for(int i = 2 ; i <= 10 ; i++)
		tmp[i] = tmp[i - 1] * 10;
	cin >> n;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
		if(n > 1000){
			col[i] = upper_bound(tmp + 1, tmp + 11, a[i]) - tmp - 1;
			cnt[col[i]]++;
		}
	}
	if(n <= 1000){
		ans = 0;
		for(int i = 1 ; i <= n ; i++)
			for(int j = 1 ; j <= n ; j++){
				if(i == j)
					continue;
				//cout << a[i] * tmp[check(a[j])] << " \n"[j == n];
				ans += a[i] * tmp[check(a[j]) + 1] + a[j];
				ans %= mod;
			}
		cout << ans;
		exit(0);
	}
	for(int i = 1 ; i <= n ; i++){
		ans += (a[i] * (n - 1)) % mod;
		ans %= mod;
		for(int j = 1 ; j <= 10 ; j++)
			if(cnt[j] > 1 || (cnt[j] == 1 && col[i] != j))
				ans = (ans + (a[i] * tmp[j + 1] % mod * (cnt[j] - (col[i] == j))) % mod) % mod;
	}
	cout << ans;
	return 0;
}