/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll power(ll x, ll n, ll m = MOD){
    if(n == 0) return 1LL;
    ll res = power(x * x % m, n/2, m);
    if(n % 2 == 1) (res *= x) %= m;
    return res;
}

void solve(){
    ll N;
    cin >> N;
    string S = to_string(N);
    ll M = S.size();
    ll ans = 1;
    ll cur = 1;
    ll idx = 1;
    ll val, start;
    ll i2 = power(2,MOD-2);
    rrep(i,M-1,0){
        ll v = S[i] - '0';
        if(i == M-1){
            ans = v * (v+1) / 2;
            cur = 0;
            val = 45;
            start = 45;
        }else{
            ll nxt = v * (ans - cur + MOD) % MOD;
            nxt += start + v * (v-1) * i2 % MOD * val % MOD;
            nxt %= MOD;
            start += power(45, idx);
            start %= MOD;
            cur += power(45, idx-1);
            cur %= MOD;
            ans = nxt;
            val *= 45;
            val %= MOD;
        
        }
        idx++;
        // print(ans);
    }
    print(ans);
    // ll sum = 0;
    // rep(i,1,N+1){
    //     ll v = 1;
    //     ll n = i;
    //     while(n > 0){
    //         v *= n % 10;
    //         n /= 10;
    //     }
    //     sum += v;
    //     if(i == N) print(i,v,sum);
    // }
    

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}