CF 122A. Lucky Division

Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7.
For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are
not.

Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number n is
almost lucky.

Input

The single line contains an integer n (1 ≤ n ≤ 1000) —
the number that needs to be checked.

Output

In the only line print "YES" (without the quotes), if number n is
almost lucky. Otherwise, print "NO" (without the quotes).

Examples

input

47

output

YES

input

16

output

YES

input

78

output

NO

Note

Note that all lucky numbers are almost lucky as any number is evenly divisible by itself.

In the first sample 47 is a lucky number. In the second sample 16 is
divisible by 4.

大概题意：问输入的数字是否只有4和7或能被这些幸运数整除 ；

强行打一个表，然后用哈希数组存储状态，然后直接判断就行；

AC代码：

#include <bits/stdc++.h>
using namespace std ;
int lu[1000]={4,7,44,77,47,74,444,777,477,747,774,744,474,447};
int x[1002];
int main()
{
int  j = 14;
for(int n = 1    ; n<=1000;n++)
{
for(int i = 0 ; i < j ; i++)
{
if(n==lu[i]||n%lu[i]==0)
{
lu[j++]=n;
x
=1;
break;
}
}
}
int m ;
cin>>m;
if(x[m]==1)
printf("YES\n");
else printf("NO\n");
return 0 ;
}