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 Main{
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int cases=Integer.valueOf(br.readLine());
		while(cases!=0)
		{
			cases--;
			String s=br.readLine();
			int ans=0;
			HashMap<String,Integer> map=new HashMap<>();
			int a=0;
			int b=0;
			for(int i=0;i<s.length();i++)
			{
				int x=0;
				int y=0;
				if(s.charAt(i)=='N')
					y=1;
				if(s.charAt(i)=='E')
					x=1;
				if(s.charAt(i)=='S')
					y=-1;
				if(s.charAt(i)=='W')
					x=-1;
				String t1=a+" "+b+" "+(a+x)+" "+(b+y);
				String t2=(a+x)+" "+(b+y)+" "+a+" "+b;
				if(map.containsKey(t1) || map.containsKey(t2))
					ans=ans+1;
				else
				{
					ans+=5;
					map.put(t1,1);
					map.put(t2, 1);
				}
				a=a+x;
				b=b+y;
			}
			System.out.println(ans);
		}
	}
}
