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.*;

public class Skier {

	static Scanner in = new Scanner(System.in);
	
	public static void main(String[] args) {
		
		int t = in.nextInt();
		
		while(t-- > 0) {
			Set<String> set = new HashSet<>();
			String line = in.next();
			int x = 0;
			int y = 0;
			int ans = 0;
			
			
			for(int i = 0; i < line.length(); i++) {
				char c = line.charAt(i);
				
				int tx = x;
				int ty = y;
				
				if(c == 'N') { y++; }
				if(c == 'S') { y--; }
				if(c == 'E') { x++; }
				if(c == 'W') { x--; }
				
				String atemp = x + " " + y + " " + tx + " " + ty;
				String btemp = tx + " " + ty + " " + x + " " + y;
				
				if(set.contains(atemp) || set.contains(btemp)) {
					ans++;
				}
				else {
					set.add(atemp);
					set.add(btemp);
					ans+=5;
				}
			}
			
			System.out.println(ans);
		}
	}
}