#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
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; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s;cin >> s;
    int n=s.size();
    vector dp(n+1,vector(2,vector(2,vector(3,vector(3,0LL)))));
    dp[0][0][0][0][0]=1;
    REP(a,n) REP(b,2) REP(c,2) REP(d,3) REP(e,3){
        int p=s[a]-'0';
        ll val=dp[a][b][c][d][e];
        REP(f,(b?10:p+1)){
            if(f==0){
                if(c) continue;
                (dp[a+1][b||(f<p)][c][d][e]+=val)%=mod;
            }
            else{
                if(f==2||f==6){
                    (dp[a+1][b||(f<p)][1][min(2,d+1)][e]+=val)%=mod;
                }
                else if(f==4||f==8){
                    (dp[a+1][b||(f<p)][1][min(2,d+2)][e]+=val)%=mod;
                }
                else if(f==5){
                    (dp[a+1][b||(f<p)][1][d][min(2,e+1)]+=val)%=mod;
                }
                else{
                    (dp[a+1][b||(f<p)][1][d][e]+=val)%=mod;
                }
            }
        }
    }
    cout << (dp[n][0][1][2][2]+dp[n][1][1][2][2])%mod << endl;
}