#include <bits/stdc++.h>
int a[10], len;
char num[11];
long long ans;
void search(int now, int pls) {
  int i, j, k, t[11][11];
  memset(t, 0, sizeof(t));
  t[0][0] = 1;
  for (i = 1; i <= len - now - 1; i++)
    for (j = 0; j <= 9; j++) {
      if (j == 4 || j == 7) {
        for (k = 1; k <= 9; k++) t[i][k] += t[i - 1][k - 1];
      } else {
        for (k = 0; k <= 9; k++) t[i][k] += t[i - 1][k];
      }
    }
  for (j = 0; j < num[now] - '0'; j++) {
    if (j == 4 || j == 7) {
      for (k = 1; k <= 9; k++) t[i][k] += t[i - 1][k - 1];
    } else {
      for (k = 0; k <= 9; k++) t[i][k] += t[i - 1][k];
    }
  }
  for (j = 0; j + pls <= 9; j++) a[j + pls] += t[i][j];
  if (num[now] == '4' || num[now] == '7') pls++;
  if (now + 1 == len) {
    a[pls]++;
    return;
  }
  search(now + 1, pls);
  return;
}
long long dfs(long long nowa, int max, int deep) {
  int i;
  long long ret = 0;
  for (i = 0; i <= max; i++) {
    if (a[i] == 0) continue;
    a[i]--;
    if (deep != 6)
      ret += nowa * dfs(a[i] + 1, max - i, deep + 1);
    else
      ret += nowa * (a[i] + 1);
    ret %= 1000000007;
    a[i]++;
  }
  return ret;
}
int main() {
  int i;
  gets(num);
  len = strlen(num);
  search(0, 0);
  a[0]--;
  for (i = 1; i <= 9; i++) {
    if (a[i] == 0) continue;
    a[i]--;
    ans += dfs(a[i] + 1, i - 1, 1);
    ans %= 1000000007;
    a[i]++;
  }
  printf("%I64d\n", ans);
  return 0;
}
