#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long int;
constexpr ll MOD = 1'000'000'007;

int main(){
    string n0;
    cin >> n0;
    vector<int> n(n0.length()+1);
    n[0] = 0;
    for(int i = 0; i < n0.length(); i++) n[i+1] = n0[i]-'0';

    vector<vector<vector<vector<vector<ll>>>>> dp(n.size(),
    vector<vector<vector<vector<ll>>>>(2,
    vector<vector<vector<ll>>>(3,
    vector<vector<ll>>(3, vector<ll>(2, 0)))));
    dp[0][0][0][0][0] = 1;
    //cerr << "dp start" << endl;
    //for(int i = 0; i < n.size(); i++) cerr << n[i] << " ";
    for(int i = 1; i < n.size(); i++){
        // from smaller == 1
        for(int smaller = 0; smaller < 2; smaller++){
            for(int cnt2 = 0; cnt2 < 3; cnt2++){
                for(int cnt5 = 0; cnt5 < 3; cnt5++){
                    //cerr << n[i] << endl;
                    for(int nonzero = 0; nonzero < 2; nonzero++){
                        for(int j = 0; j <= ((smaller == 1) ? 9 : n[i]); j++){
                            //cerr << i << " " << smaller << " " << cnt2 << " " << cnt5 << " " << j << endl;
                            if(j == 5){
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][cnt2][min(cnt5+1, 2)][1]
                                += dp[i-1][smaller][cnt2][cnt5][nonzero];
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][cnt2][min(cnt5+1, 2)][1] %= MOD;
                            }else if(j == 2 || j == 6){
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][min(cnt2+1, 2)][cnt5][1]
                                += dp[i-1][smaller][cnt2][cnt5][nonzero];
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][min(cnt2+1, 2)][cnt5][1] %= MOD;
                            }else if(j == 4 || j == 8){
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][2][cnt5][1]
                                += dp[i-1][smaller][cnt2][cnt5][nonzero];
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][2][cnt5][1] %= MOD;
                            }else if(j == 0){
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][cnt2][cnt5][0]
                                += (nonzero == 0) ? dp[i-1][smaller][cnt2][cnt5][nonzero] : 0;
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][cnt2][cnt5][0] %= MOD;
                            }else{
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][cnt2][cnt5][1]
                                += dp[i-1][smaller][cnt2][cnt5][nonzero];
                                dp[i][(smaller == 1 || j < n[i]) ? 1 : 0][cnt2][cnt5][1] %= MOD;
                            }
                        }
                    }
                }
            }
        }
    }

    ll ans = dp[n0.size()][0][2][2][1] + dp[n0.size()][1][2][2][1];
    cout << ans % MOD << endl;
    return 0;
}