Problem: There have recently been elections in the zoo. Overall there were 7 main political parties: one of them is the Little Elephant Political Party, 6 other parties have less catchy names.

Political parties find their number in the ballot highly important. Overall there are m possible numbers: 1, 2, ..., m. Each of these 7 parties is going to be assigned in some way to exactly one number, at that, two distinct parties cannot receive the same number.

The Little Elephant Political Party members believe in the lucky digits 4 and 7. They want to evaluate their chances in the elections. For that, they need to find out, how many correct assignments are there, such that the number of lucky digits in the Little Elephant Political Party ballot number is strictly larger than the total number of lucky digits in the ballot numbers of 6 other parties. 

Help the Little Elephant Political Party, calculate this number. As the answer can be rather large, print the remainder from dividing it by 1000000007 (109 + 7).

Input

A single line contains a single positive integer m (7 ≤ m ≤ 109) — the number of possible numbers in the ballot.

Output

In a single line print a single integer — the answer to the problem modulo 1000000007 (109 + 7).

Examples

Input

7


Output

0


Input

8


Output

1440

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int bit[15];
long long f[17];
int val(int x) {
  if (x == 4 || x == 7) return 1;
  return 0;
}
void solve(int n) {
  int dp[15][10][3];
  memset(dp, 0, sizeof(dp));
  int len = 0;
  int m = n;
  while (n) {
    bit[++len] = n % 10;
    n /= 10;
  }
  reverse(bit + 1, bit + len + 1);
  for (int i = 1; i < 10 && i <= m; i++) {
    if (i > bit[1]) {
      dp[1][val(i)][2]++;
    } else if (i == bit[1]) {
      dp[1][val(i)][1]++;
    } else
      dp[1][val(i)][0]++;
  }
  for (int i = 2; i <= len; i++) {
    for (int j = 0; j < 10; j++) {
      for (int k = 0; k < 10; k++) {
        dp[i][val(j) + k][0] += dp[i - 1][k][0];
        dp[i][val(j) + k][2] += dp[i - 1][k][2];
        if (j == bit[i]) {
          dp[i][val(j) + k][1] += dp[i - 1][k][1];
        } else if (j > bit[i]) {
          dp[i][val(j) + k][2] += dp[i - 1][k][1];
        } else
          dp[i][val(j) + k][0] += dp[i - 1][k][1];
      }
    }
  }
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= len; i++)
    for (int j = 0; j < 10; j++) {
      if (i == len)
        f[j] += dp[i][j][0] + dp[i][j][1];
      else
        f[j] += dp[i][j][0] + dp[i][j][1] + dp[i][j][2];
    }
}
long long pow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return ans;
}
long long ans = 0;
int a[15], b[15];
int maxn;
long long com(int n, int m) {
  if (m > n) return 0;
  long long ans = 1;
  for (int i = 0; i < m; i++) {
    ans = ans * (n - i) % mod;
  }
  return ans;
}
void cal() {
  for (int i = 0; i < 6; i++) b[i] = a[i];
  sort(b, b + 6);
  int i = 0;
  long long mul = f[maxn];
  while (i < 6) {
    int j = i;
    while (j < 6 && b[j] == b[i]) j++;
    mul = mul * com(f[b[i]], j - i) % mod;
    i = j;
  }
  ans = (ans + mul) % mod;
}
void dfs(int step, int sum) {
  if (step == 6) {
    cal();
    return;
  }
  for (int i = 0; sum + i < maxn; i++) {
    a[step] = i;
    dfs(step + 1, sum + i);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  solve(n);
  for (int i = 1; i < 10; i++) {
    if (!f[i]) continue;
    maxn = i;
    dfs(0, 0);
  }
  cout << ans << endl;
  return 0;
}