#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f
#define pii pair<int,int>

const int N = 1e6 + 20;
const int mod = 1e9 + 7;
// char a[N];
string a;
int s[N], ss[N];
int b[N];
int c[N];
int n;
void solve()
{
   
   // cin >> n >> a;
   int ans = (n * (n + 1))/2;
   ans %= mod;
   s[0] = 0;
   for(int i = 0; i < n; i++)
   {
      b[i] = a[i] - '0';
      s[i] = b[i];
      if(i != 0)
      {
         s[i] += s[i - 1];
      }
      s[i] %= mod;
      // cout << s[i] << " ";
   }
   int ret = n - 1;
   for(int i = 0, j = n - 1; i < n/2; i ++, j --)
   {
      ans = ((ans - ret + mod) % mod + mod) % mod;
      // ans -= ret;
      ret -= 2;
      // cout << " **"<< ans << " ";
      if(i == 0)
      {
         ss[i] = s[n - 1];
      }
      else
      {
         ss[i] = (ss[i - 1] + (s[j] - s[i - 1]) % mod) % mod;
      }
      c[i] =((ss[i] - (i + 1) * b[i] + ans * b[i] + mod) % mod + mod) % mod;
      ss[i] %= mod;
      c[i] %= mod;
   } 
   ans = (n * (n + 1))/2, ret = n - 1;
   ans %= mod;
   for(int i = n - 1, j = 0; j < n/2; i--, j ++)
   {
       ans = ((ans - ret + mod) % mod + mod) % mod;
      ret -= 2;
      // cout << " **"<< ans << " ";
      if(i == n - 1)
      {
         ss[i] = s[n - 1];
      }
      else
      {

         ss[i] = ((ss[i + 1] + (s[i] - s[j - 1])) % mod) % mod;
      }
      c[i] = ((ss[i] - (j + 1) *b[i] + ans * b[i] + mod) % mod + mod) % mod;
   }
   if(n % 2)
   {
      c[n/2] = ((c[n/2 - 1] + ans * b[n/2] - b[n/2] * (n/2) - ans * b[n/2 - 1] + b[n/2 - 1] * (n/2)+ mod) % mod + mod)%mod;
   }
   int ret1 = 1;
   ans = 0;
   for(int i = 0, j = n - 1; i < n; i ++, j--)
   {
      // cout << c[j] << " ";
         ans = (ans + (ret1 % mod * c[j] ) % mod)%mod;
         ret1 = (ret1 % mod * 10 % mod) % mod;
         // cout << ret1 << " ";
   }
   cout << ans << "\n";
}

signed main()
{
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
    int T = 1;
   //  cin >> T;
	while( cin >> n >> a)
	{
		solve();
	}
   return 0;
}