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

import java.sql.SQLOutput;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.concurrent.ConcurrentHashMap;


public class Main {

  public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

  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[] nextSArray() {
      String sr[] = null;
      try {
        sr = br.readLine().trim().split(" ");
      } catch (IOException e) {
        e.printStackTrace();
      }
      return sr;
    }

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

      return str;
    }
  }





  public static void main(String[] args) throws Exception {
    FastReader sc = new FastReader();


 int t=sc.nextInt();
 for(int t1=0;t1<t;++t1)
 {
  String s=sc.nextLine();
  HashMap<String,Boolean>horizontal=new HashMap<>();
   HashMap<String,Boolean>vertical=new HashMap<>();
   int n=s.length();
   int x=0,y=0;
   long cost=0;
   for(int i=0;i<n;++i)
   {
    
     char ch=s.charAt(i);
     if(ch=='N')
     {
       if(vertical.containsKey(x+" "+y+" U"))
         cost+=1;
       else
         cost+=5;
       vertical.put(x+" "+y+" U",true);
       ++y;
       vertical.put(x+" "+y+" D",true);

     }
     else if(ch=='S')
     {
       if(vertical.containsKey(x+" "+y+" D"))
         cost+=1;
       else
         cost+=5;
       vertical.put(x+" "+y+" D",true);
       --y;
       vertical.put(x+" "+y+" U",true);
     }
     else if(ch=='E')
     {
       if(horizontal.containsKey(x+" "+y+" R"))
         cost+=1;
       else
         cost+=5;
       horizontal.put(x+" "+y+" R",true);
       ++x;
       horizontal.put(x+" "+y+" L",true);
     }
     else
     {
       if(horizontal.containsKey(x+" "+y+" L"))
         cost+=1;
       else
         cost+=5;
       horizontal.put(x+" "+y+" L",true);
       --x;
       horizontal.put(x+" "+y+" R",true);
     }
   }
   out.println(cost);




 }
 out.close();




  }
}

// out.println(al.toString().replaceAll("[\\[|\\]|,]",""));