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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main{
   public static void main(String[] args) {
	  FastReader sc = new FastReader();
	
	   
	  int tests = sc.nextInt();
	  
	  while(tests > 0) {
		 tests--;
		 String s = sc.next(); 
		 HashMap<point, HashSet<Character>> map = new HashMap<point, HashSet<Character>>();
		 int path = 0;
		 int count = 0;
		 
		 point currPoint = new point(0, 0);
		 map.put(currPoint, new HashSet<Character>());

		 for(int i =0; i < s.length(); i++) {
			 
			 if(map.containsKey(currPoint) && map.get(currPoint).contains(s.charAt(i))) {
				 path++;
			
			 }
			 else {
				 path+=5;
			 }
			 HashSet<Character> newSet = map.getOrDefault(currPoint, new HashSet<Character>());
			 newSet.add(s.charAt(i));
			 map.put(currPoint, newSet);
		
			 if(s.charAt(i) == 'N') {
				 currPoint = new point(currPoint.x, currPoint.y + 1);
				 HashSet<Character> nextSet = map.getOrDefault(currPoint, new HashSet<Character>());
				 nextSet.add('S');
				 map.put(currPoint, nextSet);
			 }
			 if(s.charAt(i) == 'S') {
				 currPoint = new point(currPoint.x, currPoint.y - 1);
				 HashSet<Character> nextSet = map.getOrDefault(currPoint, new HashSet<Character>());
				 nextSet.add('N');
				 map.put(currPoint, nextSet);
			 }
			 if(s.charAt(i) == 'E') {
				 
				 currPoint = new point(currPoint.x + 1, currPoint.y);
				
				 HashSet<Character> nextSet = map.getOrDefault(currPoint, new HashSet<Character>());
				 nextSet.add('W');
				 map.put(currPoint, nextSet);
			 }
			 if(s.charAt(i) == 'W') {
				 currPoint = new point(currPoint.x - 1, currPoint.y);
				 HashSet<Character> nextSet = map.getOrDefault(currPoint, new HashSet<Character>());
				 nextSet.add('E');
				 
				 map.put(currPoint, nextSet);
			 } 
		}
		 
		 System.out.println(path);
	}
	
	 
}
   static class point{
	   
	   private int x;
	   private int y;
	   
	   public point(int x, int y) {
		   this.x = x;
		   this.y = y;
	   }
	   
	  @Override
	  
	  public boolean equals(Object o) {
		  if(o == this) return true;
		  if(!(o instanceof point)) return false;
		  point p = (point) o;
		  return p.x == this.x && p.y == this.y;
	  }
	   
	   @Override
	   public int hashCode() {
		   String s = "";
		   s += Integer.toString(x);
		   s += Integer.toString(y);
		  
           return s.hashCode();
	   }
	   
   }
   
   
  



   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;
	    }
	}
     
}