#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+3,MOD=1e9+7;
int n;
LL a[N],b[N],sum,ans;
LL hh(LL x){
	int cnt=0;
	while(x) x/=10,cnt++;
	LL mul=1;
	for(int i=1;i<=cnt;i++) mul*=10;
	return mul%MOD;
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%lld",&a[i]);
    	b[i]=hh(a[i]);
    	sum=(sum+b[i])%MOD;
    	//cout<<b[i]<<endl;
	}
	for(int i=1;i<=n;i++) ans=(ans+(sum-b[i]+(n-1)+MOD)%MOD*a[i]%MOD)%MOD;
	printf("%lld",ans);
	return 0;
}