#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll dp[11111][3][3];
void Main() {
  string s;
  cin >> s;
  ll n=s.size();
  dp[0][0][0]=1;
  rep(i,n) {
    rep(j,3) {
      rep(k,3) {
        REP(x,1,10) {
          ll y=x;
          ll p=j,q=k;
          while(y&&y%2==0) {
            p++;
            y/=2;
          }
          while(y&&y%5==0) {
            q++;
            y/=5;
          }
          p=min(p,2LL);
          q=min(q,2LL);
          dp[i+1][p][q]+=dp[i][j][k];
          dp[i+1][p][q]%=MAX;
        }
      }
    }
  }
  ll ans=0;
  ll p=0,q=0;
  rep(i,s.size()) {
    ans+=dp[n-i-1][2][2];
    ans%=MAX;
    REP(x,1,s[i]-'0') {
      ll y=x;
      ll pp=p,qq=q;
      while(y&&y%2==0) {
        pp++;
        y/=2;
      }
      while(y&&y%5==0) {
        qq++;
        y/=5;
      }
      rep(j,3) {
        rep(k,3) {
          if(j+pp>=2&&k+qq>=2) {
            ans+=dp[n-i-1][j][k];
            ans%=MAX;
          }
        }
      }
    }
    ll y=s[i]-'0';
    while(y&&y%2==0) {
      p++;
      y/=2;
    }
    while(y&&y%5==0) {
      q++;
      y/=5;
    }
  }
  ans+=p>=2&&q>=2;
  ans%=MAX;
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}