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.math.*;
public class Solution {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = Integer.parseInt(in.next());
		Map<String, Boolean> map = new TreeMap<>();
		for(int tt = 0; tt < t; tt++) {
			map.clear();
			map.put("0*0", true);
			String s = in.next();
			int x = 0;
			int y = 0;
			long ans = 0L;
			String from = "0*0";
			for(int i = 0; i < s.length(); i++) {
				if(s.charAt(i) == 'N') y += 1;
				else if(s.charAt(i) == 'S') y -= 1;
				else if(s.charAt(i) == 'E') x += 1;
				else x -= 1;
				String to = x + "*" + y;
				String check = from + "*" + to;
				if(map.containsKey(check) == true) {
					ans += 1;
				}else {
					ans += 5;
					map.put(from + "*" + to, true);
					map.put(to + "*" + from, true);
				}
				from = to;
			}
			System.out.println(ans);
		}
	}
} 