#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
int main() {
  string s;
  cin >> s;
  int n = s.size();
  vector<int> a(n);
  for (int i = 0; i < (n); i++) a[i] = s[i] - '0';
  reverse(a.begin(), a.end());
  mint sum = 0, c = 0;
  vector<mint> m(n);
  m[0] = 1;
  for (int i = 0; i < (n - 1); i++) m[i + 1] = m[i] * 10;
  for (int i = 0; i < (n); i++) {
    c += m[i] * a[i];
    sum += c * (n - i - 1);
  }
  m[0] = 0;
  for (int i = 0; i < (n - 1); i++) m[i + 1] = m[i] * 10 + 1;
  c = 0;
  for (int i = n - 1; i >= 0; i--) {
    c = c * 10 + a[i];
    sum += c * m[i];
  }
  cout << sum << endl;
  return 0;
}
