#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
int A[15], B[10];
int dp[11][10];
void add(int &a, int b) {
  a += b;
  if (a >= P) a -= P;
}
int fast(int a, int b) {
  int sum = 1;
  while (b > 0) {
    if (b & 1) sum = 1ll * sum * a % P;
    a = 1ll * a * a % P;
    b >>= 1;
  }
  return sum;
}
int C(int n, int m) {
  int sum = 1;
  for (int i = 1; i <= m; i++) {
    sum = 1ll * sum * (n - m + i) % P;
    sum = 1ll * sum * fast(i, P - 2) % P;
  }
  return sum;
}
int dfs(int pos, int K, bool lim) {
  if (K < 0) return 0;
  if (pos == 0) return K == 0;
  if (!lim && dp[pos][K] != -1) return dp[pos][K];
  int ed = lim ? A[pos] : 9;
  int sum = 0;
  for (int i = 0; i <= ed; i++) {
    if (i == 4 || i == 7) {
      sum += dfs(pos - 1, K - 1, lim && i == A[pos]);
    } else {
      sum += dfs(pos - 1, K, lim && i == A[pos]);
    }
  }
  if (!lim) dp[pos][K] = sum;
  return sum;
}
int po[10], ans;
void check(int x, int pos) {
  if (pos == 8) {
    po[pos] = x;
    int ss = 0;
    for (int i = 0; i <= 9; i++) {
      ss += po[i] * i;
    }
    if (ss >= 9) return;
    int res = 0;
    for (int i = 9; i > ss; i--) {
      res += B[i];
    }
    for (int i = 0; i <= 9; i++) {
      res = 1ll * res * C(B[i], po[i]) % P;
    }
    for (int i = 1; i <= 6; i++) res = 1ll * res * i % P;
    add(ans, res);
    return;
  }
  for (int i = 0; i <= x; i++) {
    po[pos] = i;
    check(x - i, pos + 1);
    po[pos] = 0;
  }
}
int main() {
  int m;
  memset(dp, -1, sizeof(dp));
  scanf("%d", &m);
  int len = 0;
  while (1) {
    A[++len] = m % 10;
    m /= 10;
    if (m == 0) break;
  }
  B[0] = -1;
  for (int i = 0; i <= 9; i++) {
    B[i] += dfs(len, i, 1);
  }
  check(6, 0);
  printf("%d\n", ans);
  return 0;
}
