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".

import org.omg.Messaging.SYNC_WITH_TRANSPORT;

import java.util.*;

public class AlgoPrac {

    public static void main(String[] args) {
        Scanner mz = new Scanner(System.in);
        String s=mz.nextLine();
        String[] s2=s.split("");
        int c=0;
        String f ="4";
        String v ="7";
        char d[]=s.toCharArray();
        char e[]={4,7};

        for(int i=0;i<s2.length;i++){

          /*  for(int j=i;j<e.length;j++){
            if(d[i]==e[j]) {

                c++;
            }
            }*/

          if(s2[i].contains(f)||s2[i].contains(v)){

              c++;

          }



        }

        //System.out.println(c);
        if(c==4 || c==47 ||c==744 ||c==477 ||c==7){

            System.out.println("YES");
        }else{

            System.out.println("NO");
        }



            }

        }













