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.Scanner;
import java.util.HashMap;
public class Prog1351C{
    static Scanner sc = new Scanner(System.in);
    public static void solve(){
        String st = sc.next();
        HashMap<String, Boolean> ver = new HashMap<String, Boolean>();  
        HashMap<String, Boolean> hor = new HashMap<String, Boolean>();  
        int v = 0, h = 0;
        int cost = 0;
        for (int i = 0; i < st.length() ; i++){
            if (st.charAt(i) == 'N'){
                if (ver.get(v + "-" + (v+1) + "-" + h) != null || ver.get((v+1) + "-" + v + "-" + h) != null){
                    cost = cost + 1;
                }
                else{
                    cost = cost + 5;
                    ver.put(v + "-" + (v+1) + "-" + h, true);
                }
                v++;
            }
            else if (st.charAt(i) == 'S'){
                if (ver.get(v + "-" + (v-1) + "-" + h) != null || ver.get((v-1) + "-" + v + "-" + h) != null){
                    cost = cost + 1;
                }
                else{
                    cost = cost + 5;
                    ver.put(v + "-" + (v-1) + "-" + h, true);
                }
                v--;
            }
            else if (st.charAt(i) == 'E'){
                if (hor.get(h + "-" + (h+1) + "-" + v) != null || hor.get((h+1) + "-" + h + "-" + v) != null){
                    cost = cost + 1;
                }
                else{
                    cost = cost + 5;
                    hor.put(h + "-" + (h+1) + "-" + v, true);
                }
                h++;
            }
            else{
                if (hor.get(h + "-" + (h-1) + "-" + v) != null || hor.get((h-1) + "-" + h + "-" + v) != null){
                    cost = cost + 1;
                }
                else{
                    cost = cost + 5;
                    hor.put(h + "-" + (h-1) + "-" + v, true);
                }
                h--;
            }
        }
        System.out.println(cost);
    }
    public static void main(String[] args){
        int t = sc.nextInt();
        while (t > 0){
            solve();
            t--;
        }
    }
}