#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<long double, long double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
const ll mod = 1000000007;
const ll inf = 1LL << 60;
const long double PI = acos(-1);
const long double eps = 1e-9;
template <class T, class E>
ostream& operator<<(ostream& os, pair<T, E>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class T>
inline bool chmax(T& a, T b) {
  bool x = a < b;
  if (x) a = b;
  return x;
}
template <class T>
inline bool chmin(T& a, T b) {
  bool x = a > b;
  if (x) a = b;
  return x;
}
void startupcpp() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
long double distance(ddatas x, ddatas y) {
  long double a = x.first - y.first, b = x.second - y.second;
  return sqrt(a * a + b * b);
}
ll modinv(ll a, ll m = mod) {
  ll b = m, u = 1, v = 0, t;
  while (b) {
    t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  return (u + m) % m;
}
ll moddevide(ll a, ll b) { return (a % mod * modinv(b)) % mod; }
vec modncrlistp, modncrlistm;
ll modncr(ll n, ll r) {
  if (n < r) return 0;
  ll i, size = modncrlistp.size();
  if (size <= n) {
    modncrlistp.resize(n + 1);
    modncrlistm.resize(n + 1);
    if (!size) {
      modncrlistp[0] = modncrlistm[0] = 1;
      size++;
    }
    for (i = size; i < (ll)n + 1; ++i) {
      modncrlistp[i] = modncrlistp[i - 1] * i % mod;
      modncrlistm[i] = modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n] * modncrlistm[r] % mod * modncrlistm[n - r] % mod;
}
ll modpow(ll a, ll n, ll m = mod) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}
ll gcd(ll a, ll b) {
  if (!b) return abs(a);
  return (a % b == 0) ? abs(b) : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll countdigits(ll n) {
  ll ans = 0;
  while (n) {
    n /= 10;
    ans++;
  }
  return ans;
}
ll sumdigits(ll n) {
  ll ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
ll N, M, K, H, W, A, B, C, D;
string s, t;
ll ans;
int main() {
  startupcpp();
  ll i, j = 0;
  cin >> s;
  N = s.size();
  for (i = 0; i < (ll)N - 1; ++i) {
    j = (j * 10 + s[i] - '0') % mod;
    ans += j * moddevide(modpow(10, N - i - 1) + mod - 1, 9) % mod;
  }
  j = 0;
  for (i = N, --i; i >= (ll)1; --i) {
    (j += (s[i] - '0') * modpow(10, N - i - 1)) %= mod;
    ans += j * i % mod;
  }
  cout << ans % mod << "\n";
}
