#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=140010;



signed main(){
    string s;cin>>s;
    ll n=s.size();
    vector<vector<ll> >dp(n+1,vector<ll>(100));
    ll unused=1;
    ll m=100;
    ll v=1;
    rep(i,n){
        ll c=s[i]-'0';
        if(c==0)v=0;
        REP(k,1,c){
            dp[i+1][unused*k%m]+=v;
            dp[i+1][unused*k%m]%=mod;
        }
        if(i){
            REP(k,1,10){
                dp[i+1][k]++;
                dp[i+1][k]%=mod;
            }
        }
        unused=unused*c%m;
        rep(j,100){
            REP(k,1,10){
                dp[i+1][j*k%m]=(dp[i+1][j*k%m]+dp[i][j])%mod;
            }
        }
    }
    ll ans=dp[n][0];
    if(unused==0&&v==1){
        ans++;ans%=mod;
    }
    cout<<ans<<endl;
}