Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Unfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number n is a nearly lucky number.
Input
The only line contains an integer n (1 ≤ n ≤ 1018).
Please do not use the %lld specificator to read or write 64-bit numbers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.
Output
Print on the single line "YES" if n is a nearly lucky number. Otherwise, print "NO" (without the quotes).
Examples
Input
40047
Output
NO
Input
7747774
Output
YES
Input
1000000000000000000
Output
NO
Note
In the first sample there are 3 lucky digits (first one and last two), so the answer is "NO".
In the second sample there are 7 lucky digits, 7 is lucky number, so the answer is “YES”.
In the third sample there are no lucky digits, so the answer is “NO”.
解题思路
幸运数是由4 或7或4 和7 组成的数字,这个题是接近幸运数,就是一个存在4或7的数字中,如果它里面4或者7 的个数是幸运数,那它就是接近幸运数
它给的范围是10 的18次方
用字符串来表示,也就是1到18 的 幸运数只有4 或者7
加个flag就行了
代码如下
#include<stdio.h>
#include<string.h>
int main()
{
char a[20];
int s,sum=0,i,flag=0;
scanf("%s",a);
s=strlen(a);
for(i=0;i<s;i++)
{
if(a[i]=='4'||a[i]=='7')
sum++;
}
if(sum==4||sum==7)
flag=1;
if(flag==1)
printf("YES\n");
else
printf("NO\n");
return 0;
}