CF 110A Nearly Lucky Number

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个， 就行了；

AC代码：

#include <bits/stdc++.h>
using namespace std ;
char a[50000];
int main()
{
    cin>>a;
    int len = strlen(a);
    int ans = 0 ;
    for(int i =0 ; i < len ; i++)
    {
        if(a[i]=='7'||a[i]=='4')
            ans++;
    }
    if(ans==7||ans==4)
        printf("YES\n");
    else printf("NO\n");

    return 0 ;
}