#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    string N;
    cin >> N;
    ll MOD = 1000000007;
    int l = N.size();
    vector<vector<vector<vector<ll>>>> dp(l + 1, vector<vector<vector<ll>>>(2, vector<vector<ll>>(3, vector<ll>(3, 0))));
    dp[0][0][0][0] = 1;
    rep(i, l) dp[i + 1][1][0][0] = 1;
    // dp[i + 1][smaller][j][k]: i桁までで2^j5^kの数
    rep(i, l) {
        //cout << "i=" << i << " ";
        int n = N[i] - '0';
        rep(s, 2) {
            //cout << "s=" << s << " ";
            rep(j, 3) {
                //cout << "j=" << j << " ";
                rep(k, 3) {
                    //cout << "k=" << k << " ";
                    rep(x, (s ? 10 : n + 1)) {
                        //cout << "x=" << x << " ";
                        if (x == 0) continue;
                        if (x % 4 == 0) {
                            dp[i + 1][s || x < n][min(2, j + 2)][k] += dp[i][s][j][k];
                            dp[i + 1][s || x < n][min(2, j + 2)][k] %= MOD;
                        } else if (x % 2 == 0) {
                            dp[i + 1][s || x < n][min(2, j + 1)][k] += dp[i][s][j][k];
                            dp[i + 1][s || x < n][min(2, j + 1)][k] %= MOD;
                        } else if (x == 5) {
                            dp[i + 1][s || x < n][j][min(2, k + 1)] += dp[i][s][j][k];
                            dp[i + 1][s || x < n][j][min(2, k + 1)] %= MOD;
                        } else {
                            dp[i + 1][s || x < n][j][k] += dp[i][s][j][k];
                            dp[i + 1][s || x < n][j][k] %= MOD;
                        }
                    }
                }
            }
        }
    }
    cout << (dp[l][0][2][2] + dp[l][1][2][2]) % MOD << "\n";
    /*
    rep(i, l) {
        rep(s, 2) {
            rep(j, 3) {
                rep(k, 3) {
                    cout << "dp[" << i + 1 << "][" << s << "][" << j << "][" << k << "]=" << dp[i + 1][s][j][k] << "\n";
                }
            }
        }
    }
    */
}