#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;

#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
ll dp[10001][2][3][3][2];

int main() {
    string S;
    cin >> S;
    ll N = S.size();

    dp[0][0][0][0][0] = 1;
    rep(i, N){
        rep(j, 2) rep(k, 3) rep(l, 3) rep(m, 2){
            rep(d, 10){
                if (m == 1 and d == 0) continue;
                if (j == 0 and d > S[i] - '0') continue;

                ll tj = j, tk = k, tl = l, tm = m;
                if (d < S[i] - '0') tj = 1;
                if (d == 2 or d == 6) tk = min(k + 1, 2ll);
                else if(d == 4) tk = 2;
                else if(d == 8) tk = 2;
                if (d == 5) tl = min(l + 1, 2ll);
                if (d > 0) tm = 1;

                (dp[i + 1][tj][tk][tl][tm] += dp[i][j][k][l][m]) %= MOD;
            }
        }
    }

    cout << (dp[N][0][2][2][1] + dp[N][1][2][2][1]) % MOD << endl;
}