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 prac6 {
	public static void main(String args[]) {
		Scanner in=new Scanner (System.in);
		int t=in.nextInt();
		while(--t>=0) {
			char s[]=in.next().toCharArray();
			int xe=0,ye=0, xs=0, ys=0;
			int n=s.length;
			HashSet<String> hset=new HashSet<>();
			long ans=0;
			for(int i=0;i<n;i++) {
				xs=xe;
				ys=ye;
				if(s[i]=='E')
					xe++;
				else if(s[i]=='W')
					xe--;
				else if(s[i]=='N')
					ye--;
				else
					ye++;
				
				String val1 = xs+"_"+ys+"_"+xe+"_"+ye;
				String val2 = xe+"_"+ye+"_"+xs+"_"+ys;
				if(hset.contains(val1) || hset.contains(val2))
					ans=ans+1;
				else {
					ans=ans+5;
					hset.add(val1);
				}
			}
			
			System.out.println(ans);
		}		
	}
}
