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

	public static void calc_time(String path) {
		int x = 0, y = 0;
		int time = 0;
		Set<String> road = new HashSet<>();
		for (int i = 0; i < path.length(); i++) {
			String start = x + " " + y;
			if (path.charAt(i) == 'N') {
				y--;
			} else if (path.charAt(i) == 'S') {
				y++;
			} else if (path.charAt(i) == 'W') {
				x--;
			} else if (path.charAt(i) == 'E') {
				x++;
			}
			String finish = x + " " + y;
			String route = start + " " + finish;
			String reverseRoute = finish + " " + start;
			if (road.contains(route) || road.contains(reverseRoute)) {
				time++;
			} else {
				time += 5;
				road.add(route);
				road.add(reverseRoute);
			}
		}
		System.out.println(time);
	}
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		long t = sc.nextInt();
		while (t-- > 0) {
			String s = sc.next();
			calc_time(s);
		}
	}
}