//IN THE NAME OF GOD
//20689
#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

unsigned short n[14]={4,7,44,47,74,77,444,447,474,477,744,747,774,777};			//correct
unsigned long long c[1001][1001]={1};											//correct
unsigned long long power[1001]={1,8};											//correct

int main()
{
	for(unsigned short i=1;i<1001;i++)											//correct
	{
		c[i][i]=c[0][i]=1;
		power[i]=(8*power[i-1])%1000000007;
	}
	for(unsigned short i=1;i<1001;i++)											//correct
		for(unsigned short j=1;j<i;j++)
			c[j][i]=(c[j-1][i-1]+c[j][i-1])%1000000007;

	unsigned long long ans=0,temp;
	for(unsigned short j=0;j<14;j++)
		for(unsigned short i=0;i<14;i++)
		{
			if(n[j]+n[i]<=1000)
			{
				temp=(c[n[i]+n[j]][1000]*c[n[i]][n[i]+n[j]])%1000000007;
				ans+=(temp*power[1000-n[i]-n[j]])%1000000007;
			}
		}

	cout<<ans%32971<<endl;
	return 0;
}