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.HashSet;
import java.util.Scanner;

public class C {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int t = s.nextInt();
		while(t-->0) {
			String str = s.next();
			int x = 0,ans = 0, y = 0;
			HashSet<String> set = new HashSet<String>();
			for(int i = 0; i < str.length(); i++) {
				int dx = 0, dy = 0;
				if(str.charAt(i) == 'N') {
					dy = 1;
				} else if(str.charAt(i) == 'S') {
					dy = -1;
				} else if(str.charAt(i) == 'E') {
					dx = 1;
				} else {
					dx = -1;
				}
				int X = x + dx, Y = y + dy;
				String str1 = x + " " + y + " " + X + " " + Y, str2 = X + " "  + Y + " " + x + " " + y;
				if(set.contains(str1) || set.contains(str2)) {
					ans++;
				} else {
					ans += 5;
				}
				set.add(str1);
				set.add(str2);
				x = X;
				y = Y;
			}
			System.out.println(ans);
			
		}

	}

}
