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 javafx.util.Pair;

import java.io.*;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Skier_1400 {
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        int T = sc.nextInt();
        while(T --> 0) {
            String s = sc.nextLine();
            int xCoordinate = 0;
            int yCoordinate = 0;
            int lastX = 0;
            int lastY = 0;
            HashSet<String> visited = new HashSet<>();
            visited.add(xCoordinate + " " + yCoordinate + " " + lastX + " " + lastY);
            visited.add(lastX + " " + lastY + " " + xCoordinate + " " + yCoordinate);
            int total = 0;
            for(int i = 0; i < s.length(); i++) {
                lastX = xCoordinate;
                lastY = yCoordinate;
                if(s.charAt(i) == 'N') {
                    yCoordinate++;
                } else if(s.charAt(i) == 'W') {
                    xCoordinate--;
                } else if(s.charAt(i) == 'S') {
                    yCoordinate--;
                } else {
                    xCoordinate++;
                }
                if(visited.contains(xCoordinate + " " + yCoordinate + " " + lastX + " " + lastY)
                        || visited.contains(lastX + " " + lastY + " " + xCoordinate + " " + yCoordinate)) {
                    total += 1;
                } else {
                    if(!visited.contains(xCoordinate + " " + yCoordinate + " " + lastX + " " + lastY)) {
                        visited.add(xCoordinate + " " + yCoordinate + " " + lastX + " " + lastY);
                    }
                    if(!visited.contains(lastX + " " + lastY + " " + xCoordinate + " " + yCoordinate)) {
                        visited.add(lastX + " " + lastY + " " + xCoordinate + " " + yCoordinate);
                    }
                    total += 5;
                }
            }
            System.out.println(total);

        }
        out.close();
    }
    public static PrintWriter out;

    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            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;
        }

    }

}
