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.BufferedReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Vector;

import javax.swing.text.StyledEditorKit.ForegroundAction;


public class main {
	/*public static void main(String[] args) throws NumberFormatException, IOException
	{
		BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw= new PrintWriter(System.out);
				int T= Integer.parseInt(br.readLine());
		for (int i = 0; i < T; i++) {
			StringTokenizer st= new StringTokenizer(br.readLine());
			Integer[] a= new Integer[3];
			a[0]=Integer.parseInt(st.nextToken());
			a[1]=Integer.parseInt(st.nextToken());
			a[2]=Integer.parseInt(st.nextToken());
			Arrays.sort(a);
			int diff0=4-a[0];
			int diff1=2-a[1];
			int diff2=1-a[2];
			if(diff0<0)
				diff0=0;
			if(diff1<0)
				diff1=0;
			if(diff2<0)
				diff2=0;
			pw.println(7-diff0-diff1-diff2);
		}
		
		pw.close();
	}*/
	
	public static void main(String[] args) throws NumberFormatException, IOException{
		BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw= new PrintWriter(System.out);
		int t= Integer.parseInt(br.readLine());
		for (int i = 0; i < t; i++) {
			TreeSet<String> map= new TreeSet<String>(); 
			String s= br.readLine();
			int x=0;
			int y=0;
			int cost=0;
			for (int j = 0; j < s.length(); j++) {
				String path="";
				if(s.charAt(j)=='N')
				{
					int temp=y+1;
					path=x+"-"+y+"-"+x+"-"+temp;
					y=temp;
				}
				else if(s.charAt(j)=='S')
				{
					int temp=y-1;
					path=x+"-"+temp+"-"+x+"-"+y;
					y=temp;
				}
				else if(s.charAt(j)=='E')
				{
					int temp=x+1;
					path=x+"-"+y+"-"+temp+"-"+y;
					x=temp;
				}
				else if(s.charAt(j)=='W')
				{
					int temp=x-1;
					path=temp+"-"+y+"-"+x+"-"+y;
					x=temp;
				}
				if(map.contains(path))
				{
					cost++;
				}
				else
				{
					cost+=5;
					map.add(path);
				}
			}
			pw.println(cost);
		}
		pw.close();
	}
}
