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.util.*;
import java.io.*;

public class Solve{
    public static void main(String[] args) throws Exception{
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        StringBuilder s=new StringBuilder();

        while(t-->0){
           String st=sc.next();
           int n=st.length();
         
           
          int ans=0,x=0,y=0;
			Set<String> map = new HashSet<>();
			for(int i=0;i<n;i++)
			{
				int tx = x;
				int ty = y;
 
				if(st.charAt(i) == 'N')y++;
				else if(st.charAt(i) == 'S')y--;
				else if(st.charAt(i) == 'E')x++;
				else if(st.charAt(i) == 'W')x--;
 
				String ap = x +" " + y + " " + tx + " " + ty;
				String bp = tx +" " + ty + " " + x + " " + y;
            
				if(map.contains(ap) || map.contains(bp))
				{
					ans++;
				}
				else
				{
					ans += 5;
					map.add(ap);
				}
			}
		           s.append(ans+"\n");
        }
        System.out.println(s);
      
    }
}