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.io.*;
public class R16C {
 
	public static void main(String[] args) throws Exception{
		int num = 998244353;
		// TODO Auto-generated method stub
 		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
 		PrintWriter out = new PrintWriter(System.out);
 		int n = Integer.parseInt(bf.readLine());
 		for(int i = 0;i<n;i++){
 			String a = bf.readLine();
 			int x = 0;
 			int y = 0;
 			Set<List<Integer>> seen = new HashSet<List<Integer>>();
 			ArrayList<Integer> array = new ArrayList<Integer>();
 			int count = 0;
 			for(int j = 0;j<a.length();j++){
				ArrayList<Integer> ab = new ArrayList<Integer>();
				ArrayList<Integer> cd = new ArrayList<Integer>();
 				if (a.charAt(j) == 'N'){
 					ab.add(x);
 					ab.add(y);
 					ab.add(x);
 					ab.add(y+1);
 					cd.add(x);
 					cd.add(y+1);
 					cd.add(x);
 					cd.add(y);
 					y+=1;
 				}
 				if (a.charAt(j) == 'S'){
 					ab.add(x);
 					ab.add(y);
 					ab.add(x);
 					ab.add(y-1);
 					cd.add(x);
 					cd.add(y-1);
 					cd.add(x);
 					cd.add(y);
 					y-=1;
 				}
 				if (a.charAt(j) == 'W'){
 					ab.add(x);
 					ab.add(y);
 					ab.add(x-1);
 					ab.add(y);
 					cd.add(x-1);
 					cd.add(y);
 					cd.add(x);
 					cd.add(y);
 					x-=1;
 				}
 				if (a.charAt(j) == 'E'){
 					ab.add(x);
 					ab.add(y);
 					ab.add(x+1);
 					ab.add(y);
 					cd.add(x+1);
 					cd.add(y);
 					cd.add(x);
 					cd.add(y);
 					x+=1;
 				}
 				if (seen.contains(ab) || seen.contains(cd))
 					count+=1;
 				else{
 					seen.add(ab);
 					seen.add(cd);
 				}
 			}
 			out.println(5*a.length() - 4 * count);
 		}
 		out.close();
 		
	}
 
}