#include<bits/stdc++.h>
using namespace std;
#define ls(p) (p<<1)
#define rs(p) (ls(p)^1)
#define int long long
typedef pair<int,int> pii;
//typedef long long ll;
const int mod=1e9+7;
const double eps=1e-6;
const int INF=9223372036854775807;
const int N=1e5+5;
pii a[N];
int fac[10];
inline int read();
inline void solve(){
	int n=read(),ans=0,sum=0,sumfac=0;fac[0]=1;
	for(int i=1;i<=10;++i)fac[i]=fac[i-1]*10%mod;
	for(int i=1;i<=n;++i){
		int x=read(),cnt=0;
		sum=(sum+x)%mod;
		a[i].first=x;
		while(x>0){
			x/=10,cnt++;
		}
		a[i].second=cnt;
		sumfac=(sumfac+fac[a[i].second])%mod;
	}
	ans=(n-1)*sum%mod;
	for(int i=1;i<=n;++i){
		int tmp=((sumfac-fac[a[i].second])%mod+mod)%mod;
		ans=(ans+tmp*a[i].first%mod)%mod;
	}
	printf("%lld\n",ans);
}
signed main(){
	int T=1;
//	int T=read();
	while(T--)solve();
	return 0;
}
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*f;
}