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.*;
import java.util.*;

public class Solution {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

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

    private static FastReader s;
    public static void main(String[] args) {
        s = new FastReader();
        Solution c=new Solution();

        int T=s.nextInt();
        for (int t=1; t<=T; t++){
            c.solve(t);
        }
    }
    //System.out.println("Case #"+t+": "+ans);

    void solve(int t){
        String str = s.nextLine().trim();
        Set<List<Integer>> set = new HashSet<>();

        int x = 0, y = 0;
        int ans = 0;
        for (char c : str.toCharArray()){
            List<Integer> list = new ArrayList<>();
            list.add(x);
            list.add(y);
            if (c == 'N') y++;
            if (c == 'S') y--;
            if (c == 'E') x++;
            if (c == 'W') x--;
            list.add(x);
            list.add(y);

            List<Integer> rlist = new ArrayList<>();
            rlist.add(list.get(2));
            rlist.add(list.get(3));
            rlist.add(list.get(0));
            rlist.add(list.get(1));

            if (!set.contains(list) && !set.contains(rlist)){
                ans += 5;
            }

            else{
                ans += 1;
            }
            set.add(list);
            set.add(rlist);
        }
        System.out.println(ans);
    }
}
