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 Skier {

	public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
		int t = in.nextInt();in.nextLine();
		while(t-->0) {
			char ch[] = in.nextLine().toCharArray();
			HashSet<String> set = new HashSet<>();
			long cnt = 0;
			int x,y,px,py;
			x=y=0;
			for(int i=0;i<ch.length;i++) {
				px = x;py = y; 
				if(ch[i]=='N') x+=1;
				else if(ch[i]=='S') x+=-1;
				else if(ch[i]=='W') y+=-1;
				else y+=1;
				String s1 = (""+x)+" "+(""+y)+" "+(""+px)+" "+(""+py);
				String s2 = (""+px)+" "+(""+py)+" "+(""+x)+" "+(""+y);
				if(set.contains(s1)||set.contains(s2))
					cnt+=1;
				else {
					cnt+=5;
					set.add(s1);
				}
				
			}
			out.println(cnt);
		}
		out.close();in.close();
	}
}







