CodeForces 110A Nearly Lucky N…

CodeForces110A

Nearly LuckyNumber

Time Limit: 2000MS

Memory Limit: 262144K

64bit IO Format: %I64d & %I64u

[Submit]  [Go Back]   [Status]  

Description

Petya loves lucky numbers. Weall know that lucky numbers are the positive integers whose decimalrepresentations 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 numbernearly lucky if the numberof lucky digits in it is a lucky number. He wonders whether numbern is a nearly luckynumber.

Input

The only line contains an integer n (1 ≤ n ≤ 10¹⁸).

Please do not use the %lld specificator to read or write 64-bitnumbers 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 thequotes).

Sample Input

Input

40047

Output

NO

Input

7747774

Output

YES

Input

1000000000000000000

Output

NO

Hint

In the first sample there are 3 lucky digits (first one and lasttwo), so the answer is "NO".

In the second sample there are 7 lucky digits, 7 is luckynumber, so the answer is "YES".

In the third sample there are no lucky digits, so the answer is"NO".

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <string.h>
#include <iostream>
using namespace std;
int main()
{
      int n;
      inti,t;
      charstr[25];
      while(cin>>str)
      {
     
            intlen=strlen(str);
                t=0;
            for (inti=0;i<len;i++)
            {
                  if(str[i]=='4'||str[i]=='7')
                  {t++;}
            }
                  if(t==4||t==7)
                    cout<<"YES\n";
                    elsecout<<"NO\n";
     
     
      }
  return 0;
}