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
            
 
/* package codechef; // don't place package name! */
import java.io.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.StringTokenizer; 
import java.util.*;
import java.awt.*;





public class HelloWorld{

    public static void main(String[] args) throws IOException 
    { 
  
        Scanner input = new Scanner(System.in);
        input.nextInt();
        HashSet<String> s=new HashSet<>();
        while(input.hasNext()){
            s.clear();
            String a=input.next();
            int t=0;
            int[] a1=new int[4];
            for(int i=0;i<a.length();i++){
                int x1=a1[0];
                int y1=a1[1];
                int x2=a1[2];
                int y2=a1[3];
                a1[0]=x2;
                a1[1]=y2;
                if(a.charAt(i)=='W'){
                    a1[2]=x2+1;
                    
                }
                if(a.charAt(i)=='E'){
                    a1[2]=x2-1;
                }
                if(a.charAt(i)=='N'){
                    a1[3]=y2+1;
                }
                if(a.charAt(i)=='S'){
                    a1[3]=y2-1;
                }
                int[] t1=new int[4];
                t1[0]=a1[2];
                t1[1]=a1[3];
                t1[2]=a1[0];
                t1[3]=a1[1];
                if(s.contains(Arrays.toString(t1)) || s.contains(Arrays.toString(a1))){
                    t++;
                    continue;
                }
                t+=5;
                s.add(Arrays.toString(a1));
                s.add(Arrays.toString(t1));
                
            }
            System.out.println(t);
        }
        }
 
    
}