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

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		while(T-->0){
			HashSet<String> set = new HashSet<>();
			int n=0,e=0;
			String str = n+" "+e;
			set.add(str);
			str = sc.next();
			long ans = 0;
			for(int i=0;i<str.length();i++){
				char ch = str.charAt(i);
				int nn = n;
				int ee = e;
				if(ch == 'N'){
					n++;
				}
				else if(ch == 'S'){
					n--;
				}
				else if(ch == 'E'){
					e++;
				}
				else{
					e--;
				}
				String s1 = nn+" "+ee+" "+n+" "+e;
				String s2 = n+" "+e+" "+nn+" "+ee;
				if(set.contains(s1) || set.contains(s2)){
					ans++;
				}
				else{
					set.add(s1);
					set.add(s2);
					ans+=5;
				}
			}
			System.out.println(ans);
		}
		
	}

}
