#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const ll MOD=1e9+7;

ll modpow(ll x,ll n){
  ll ans=1;
  while(n){
    if(n&1) ans=ans*x%MOD;
    x=x*x%MOD;
    n/=2;
  }
  return ans;
}

int main(){
  string s;
  cin>>s;
  
  ll n=s.size();
  ll tmp=1LL;
  ll now=modpow(45LL,n);
  ll a=(now-45LL+MOD)%MOD*204545456LL%MOD;
  ll sum=0LL;
  rep(i,n){
    now=now*822222228LL%MOD;
    sum=(sum+(s[i]-'0'-1)*(s[i]-'0')/2LL*now%MOD*tmp%MOD)%MOD;
    tmp=tmp*(s[i]-'0')%MOD;
  }
  cout<<(sum+tmp+a)%MOD<<endl;

  return 0;
}