#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
const double eps = 1e-6;
char a[12];
int p[2][2][10][10];
int dp(bool bl, bool sm, int i, int q) {
  if (i == 10) {
    if (q == 0 && bl) return 1;
    return 0;
  }
  if (q == -1) return 0;
  int &pr = p[bl][sm][i][q];
  if (pr != -1) return pr;
  pr = 0;
  int mx = (sm == 1) ? 9 : a[i];
  for (int k = 0; k <= mx; k++) {
    pr += dp((bl == 1) ? 1 : (k > 0), (sm == 1) ? 1 : (k < mx), i + 1,
             (k == 4 || k == 7) ? q - 1 : q);
  }
  return pr;
}
int fr[10], y;
long long int rs;
void rec(int i, int s, long long int x) {
  if (i == 6) {
    rs += (x * fr[y]) % 1000000007LL;
    rs %= 1000000007LL;
    return;
  }
  for (int k = 0; k <= s; k++) {
    if (!fr[k]) continue;
    fr[k]--;
    rec(i + 1, s - k, (x * (fr[k] + 1LL)) % 1000000007LL);
    fr[k]++;
  }
}
int main() {
  int cs = 1, t, i, j, k;
  memset(p, -1, sizeof(p));
  memset(fr, 0, sizeof(fr));
  scanf("%d", &k);
  for (i = 9; i > -1; i--) {
    a[i] = k % 10;
    k /= 10;
  }
  for (i = 0; i < 10; i++) {
    fr[i] = dp(0, 0, 0, i);
  }
  rs = 0LL;
  for (i = 1; i < 10; i++) {
    y = i;
    if (fr[i]) rec(0, i - 1, 1LL);
  }
  printf("%lld\n", rs);
  return 0;
}
