#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp(Tx, Ty) make_pair(Tx, Ty)
#define For(Ti, Ta, Tb) for(auto Ti = (Ta); Ti <= (Tb); Ti++)
#define Dec(Ti, Ta, Tb) for(auto Ti = (Ta); TI >= (Tb); Ti--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
const int N = 1e5 + 5, mod = 1e9 + 7;
long long a[N]; 
int n;
long long sum;
long long it[N];
long long sum1;
int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	cin >> n;
	For(i, 1, n) cin >> a[i];
	For(i, 1, n) {
		int cnt = 0;
		long long b = a[i];
		while (b) {
			b /= 10;
			cnt++;
		}
		long long now = 1;
		while (cnt) {
			now = now * 10 % mod;
			cnt--;
		}
		it[i] = now;
		sum = (sum + now) % mod;
		sum1 = (a[i] + sum1) % mod;
	}
	long long ans = 0;
	For(i, 1, n) {
		ans = (((ans + (sum - it[i] + mod) % mod * a[i] % mod) % mod + (sum1 - a[i] + mod) % mod) % mod) % mod;
	}
	cout << ans;
	return 0;
}