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.lang.Math;

public class codeforce{

	public static void main(String args[]){
		Scanner sj = new Scanner(System.in);
		int t = sj.nextInt();
		
		while(t-->0){			
			String s = sj.next();
			HashSet<String> h = new HashSet<>();
			int x = 0, y = 0;
			long ans = 0;
			for(int i=0;i<s.length();i++){
				char c = s.charAt(i);
				int x1 = x, y1 = y;
				if(c=='E'){
					x++;
				}else if(c=='W'){
					x--;
				}else if(c=='N'){
					y++;
				}else if(c=='S'){
					y--;
				}
				String temp1 = x1+" "+y1+" "+x+" "+y;
				String temp2 = x+" "+y+" "+x1+" "+y1;
				if(h.contains(temp1)||h.contains(temp2)){
					ans+=1;
				}else{
					h.add(temp1);
					ans+=5;
				}
			}
			System.out.println(ans);
		}
	}

}