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
//package codeforces.div2;

import java.util.HashSet;
import java.util.Scanner;

public class Skier {

    static public void print(String s) {


        long count = 0;
        long x = 0;
        long y = 0;
        HashSet<String> set = new HashSet<>();
        boolean flag = false;
        for(int i = 0; i < s.length(); i++) {

            long a = x;
            long b = y;
            if(s.charAt(i) == 'N') {
                y--;
            }
            if(s.charAt(i) == 'S') {
                y++;
            }
            if(s.charAt(i) == 'W') {
                x--;
            }
            if(s.charAt(i) == 'E') {
                x++;
            }

            long upA = x;
            long upB = y;

            String sb = a + "_" + b + "_" + upA + "_" + upB;
            String sb1 = upA + "_" + upB + "_" +  a + "_" + b;

            if(set.contains(sb)) {
                count++;
            } else {
                if(set.contains(sb1)) {
                    count++;
                } else {
                    count = count + 5;
                    set.add(sb);
                    set.add(sb1);
                }
            }


        }
        System.out.println(count);
    }

    public static void main(String []args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while ( n > 0) {
            String s = sc.next();
            print(s);
            n--;
        }
    }
}
