Skier rides on a snowy field. Its movements can be described by a string of characters 'S', 'N', 'W', 'E' (which correspond to 1 meter movement in the south, north, west or east direction respectively).

It is known that if he moves along a previously unvisited segment of a path (i.e. this segment of the path is visited the first time), then the time of such movement is 5 seconds. If he rolls along previously visited segment of a path (i.e., this segment of the path has been covered by his path before), then it takes 1 second.

Find the skier's time to roll all the path.

Input

The first line contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases in the input. Then t test cases follow.

Each set is given by one nonempty string of the characters 'S', 'N', 'W', 'E'. The length of the string does not exceed 10^5 characters.

The sum of the lengths of t given lines over all test cases in the input does not exceed 10^5.

Output

For each test case, print the desired path time in seconds.

Example

Input


5
NNN
NS
WWEN
WWEE
NWNWS


Output


15
6
16
12
25


    

    import java.io.*;
    import java.util.*;
     public class CFG
    {
        public static void main(String args[])
        {
            Scanner sc=new Scanner (System.in);
            int t=sc.nextInt();
            String q="",q1="";
           int e=0,r=0;
            while(t-->0)
            { Set<String> set=new HashSet<>();
                String a=sc.next();
                int i=0,v=0,h=0,count=0;
                while(i<a.length())
                {q=" ";
              e=v;
                r=h;
                
                
                    if(a.charAt(i)=='S')
                        v--;
                        if(a.charAt(i)=='N')
                        v++;
                        if(a.charAt(i)=='W')
                        h--;
                        if(a.charAt(i)=='E')
                        h++;
                        q=v+" "+h+" "+e+" "+r;
                       
                        if(set.contains(q)||set.contains( e+" "+r+" "+v+" "+h))
                        count++;
                        else {
                            set.add(q);
                            
                            
                            count+=5;
                }

                    i++;
                }
            
            System.out.println(count);
        }}
    }

