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 C1351 {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
	static StringTokenizer st;
	public static void main(String[]args)throws IOException {
		int t = readInt();
		while(t--!=0) {
			String s = next();
			Set<Long>set = new HashSet<Long>();
			int curx = 0;
			int cury = 0;
			int time = 0;
			for(int i = 0; i<s.length(); i++) {
				int num = set.size();
				if(s.charAt(i)=='N') {
					set.add((long)curx*1000000+(long)curx*1000000+cury+cury+1);
					if(set.size()==num)time+=1;
					else time+=5;
					cury++;
				}
				else if(s.charAt(i)=='S') {
					set.add((long)curx*1000000+(long)curx*1000000+cury+cury-1);
					if(set.size()==num)time+=1;
					else time+=5;
					cury--;
				}
				else if(s.charAt(i)=='E') {
					set.add((long)curx*1000000+((long)curx+1)*1000000+cury+cury);
					if(set.size()==num)time+=1;
					else time+=5;
					curx++;
				}
				else if(s.charAt(i)=='W') {
					set.add((long)curx*1000000+((long)curx-1)*1000000+cury+cury);
					if(set.size()==num)time+=1;
					else time+=5;
					curx--;
				}
			}
			pr.println(time);
		}
		pr.close();
	}
	static String next () throws IOException {
		while (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine().trim());
		return st.nextToken();
	}
	static long readLong () throws IOException {
		return Long.parseLong(next());
	}
	static int readInt () throws IOException {
		return Integer.parseInt(next());
	}
	static double readDouble () throws IOException {
		return Double.parseDouble(next());
	}
	static char readCharacter () throws IOException {
		return next().charAt(0);
	}
	static String readLine () throws IOException {
		return br.readLine().trim();
	}
}
