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 CF1351C {
	static FastReader in = new FastReader();

	public static void main(String[] args) {
		int t = in.nextInt();
		while(t-- > 0) solve();
	}

	static void solve() {
		char[] s = in.nextLine().toCharArray();
		int n = s.length;
		HashSet<String> set = new HashSet<>();
		List<Integer> orig = new ArrayList<>();
		
		int x = 0;
		int y = 0;
		int len = 0;
		for(int i = 0; i < n; i++)
		{
			String before = x + " " + y;
			if(s[i] == 'W')
				y--;
			
			else if(s[i] == 'E')
				y++;
			
			else if(s[i] == 'N')
				x++;
			
			else if(s[i] == 'S')
				x--;

			String neww = x + " " + y;
			String s1 = before + " " + neww;
			String s2 = neww  + " " + before;
			
			if(set.contains(s1) || set.contains(s2)) len++;
			else 
			{
				set.add(s1);
				set.add(s2);
				len += 5;
			}
		}
		System.out.println(len);
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}

		int[] readarr(int abc) {
			int[] a = new int[abc];
			for (int i = 0; i < abc; i++)
				a[i] = nextInt();
			return a;
		}
	}
}



