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

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
	
	BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
	int t=Integer.parseInt(bf.readLine());
	while(t-->0)
	{
	    String s=bf.readLine();
	    int n=s.length();
	    long sum=0L;
	    HashSet<String> hs=new HashSet<>();
	    int oldx=0,oldy=0,newx=0,newy=0;
	    for(int i=0;i<n;i++)
	    {
	        if(s.charAt(i)=='E')
	        {
	            newx++;
	        }
	        else if(s.charAt(i)=='W')
	        {
	            newx--;
	        }
	        else if(s.charAt(i)=='N')
	        {
	            newy++;
	        }
	        else if(s.charAt(i)=='S')
	        {
	            newy--;
	        }
	        
	        String s1=oldx+" "+oldy+" "+newx+" "+newy;
	        String s2=newx+" "+newy+" "+oldx+" "+oldy;
	        if(hs.contains(s1) || hs.contains(s2))
	        {
	            sum++;
	        }
	        else
	        {
	            sum+=5;
	            hs.add(s1);
	            hs.add(s2);
	        }
	        
	        oldx=newx;
	        oldy=newy;
	        
	    }
	    System.out.println(sum);
	}
	
	}
}