#include <bits/stdc++.h>

#include <atcoder/modint>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

using namespace atcoder;
using mint = modint1000000007;

mint dp[10010][2][3][3];

int f(int k, int x) { return min(2, k + __builtin_ctz(x)); }

int g(int l, int x) { return min(2, l + (x == 5)); }

int main() {
    string s;
    cin >> s;
    int n = s.size();

    rep(i, n) {
        if (i == 0) dp[i][0][f(0, s[i] - '0')][g(0, s[i] - '0')] = 1;
        int mx = (i == 0 ? s[i] - '0' - 1 : 9);
        For(x, 1, mx + 1)++ dp[i][1][f(0, x)][g(0, x)];
    }
    For(i, 1, n) rep(j, 2) rep(k, 3) rep(l, 3) if (dp[i - 1][j][k][l] != 0) {
        int mx = (j ? 9 : s[i] - '0');
        For(x, 1, mx + 1) {
            dp[i][j | (x < s[i] - '0')][f(k, x)][g(l, x)] += dp[i - 1][j][k][l];
        }
    }
    printf("%u\n", (dp[n - 1][0][2][2] + dp[n - 1][1][2][2]).val());
}