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 JAVA):

Solution:
import java.io.*;
import java.util.*;
public final class little_elephant
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static Random rnd=new Random();
	static long[][][] dp,dp2;
	static long[] val,fact;
	static long mod=(long)(1e9+7);
	
	static long solve(int flag,int lucky,int idx,char[] a,int x)
	{
		if(idx>=a.length)
		{
			return (lucky==x?1:0);
		}
		if(dp[flag][lucky][idx]!=-1)
		{
			return dp[flag][lucky][idx];
		}
		else
		{
			long ret=0;
			if(flag==0)
			{
				for(char i='0';i<=a[idx];i++)
				{
					ret=(ret+solve(i<a[idx]?1:0,(i=='4' || i=='7')?lucky+1:lucky,idx+1,a,x));
				}
			}
			else
			{
				for(char i='0';i<='9';i++)
				{
					ret=(ret+solve(1,(i=='4' || i=='7')?lucky+1:lucky,idx+1,a,x));
				}
			}
			dp[flag][lucky][idx]=ret;return ret;
		}
	}
	
	static long get(int[] a)
	{
		int[] cnt=new int[11];long ret=1;
		for(int i=0;i<6;i++)
		{
			cnt[a[i]]++;
		}
		for(int i=0;i<11;i++)
		{
			long now=val[i];
			while(cnt[i]>0)
			{
				ret=(ret*now)%mod;cnt[i]--;now--;
			}
		}
		return ret;
	}
	
    public static void main(String args[]) throws Exception
    {
		char[] a=sc.next().toCharArray();val=new long[11];long res=0;
		for(int i=0;i<=10;i++)
		{
			dp=new long[2][11][11];
			for(int j=0;j<2;j++)
			{
				for(int k=0;k<11;k++)
				{
					for(int x=0;x<11;x++)
					{
						dp[j][k][x]=-1;
					}
				}
			}
			val[i]=(solve(0,0,0,a,i)+(i==0?-1:0));
		}
		long[] pre=new long[11];
		for(int i=0;i<11;i++)
		{
			for(int j=0;j<=i;j++)
			{
				for(int k=0;k<=i;k++)
				{
					for(int x=0;x<=i;x++)
					{
						for(int y=0;y<=i;y++)
						{
							for(int z=0;z<=i;z++)
							{
								int curr=i-(j+k+x+y+z);
								if(curr>=0)
								{
									pre[i]=(pre[i]+get(new int[]{j,k,x,y,z,curr}))%mod;
								}
							}
						}
					}
				}
			}
		}
		long tot=0;
		for(int i=0;i<11;i++)
		{
			tot=(tot+pre[i])%mod;pre[i]=tot;
		}
		for(int i=1;i<11;i++)
		{
			long curr1=val[i],curr2=pre[i-1],curr3=(curr1*curr2)%mod;res=(res+curr3)%mod;
		}
		out.println(res);out.close();
    }
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}