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

	public static void main(String[] args) {
		Scanner scan  =new Scanner(System.in);
		int t = scan.nextInt();
		while(t-->0) {
			char[] a = scan.next().toCharArray();
			int x = 0, y = 0;
			HashSet<edge> set = new HashSet<>();
			int ans = 0;
			for(int i = 0;i<a.length;i++) {
				int tox = x;
				int toy = y;
				if(a[i]=='N')toy++;
				else if(a[i]=='S')toy--;
				else if(a[i]=='W')tox--;
				else tox++;
				if(set.contains(new edge(x, y, tox,toy))) {
					ans+=1;
				}else ans+=5;
				set.add(new edge(x, y, tox, toy));
				set.add(new edge(tox,toy, x, y));
				x = tox;
				y = toy;
			}
			System.out.println(ans);
		}
	}
	static class edge{
		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + tox;
			result = prime * result + toy;
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}
		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			edge other = (edge) obj;
			if (tox != other.tox)
				return false;
			if (toy != other.toy)
				return false;
			if (x != other.x)
				return false;
			if (y != other.y)
				return false;
			return true;
		}
		int x, y, tox, toy;
		public edge(int a, int b,int c, int d) {
			x = a;
			y =b;
			tox = c;
			toy = d;
		}
	}
}
