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.*;

public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        StringBuilder ans = new StringBuilder();
        int t = sc.nextInt();
        while (t-- > 0) {
            char[] path = sc.next().toCharArray();
            Set<List<Integer>> visited = new HashSet<>();
            int x = 0;
            int y = 0;
            int tmp = 0;
            for (int i = 0; i < path.length; i++) {
                int nx = x;
                int ny = y;
                if (path[i] == 'S') ny--;
                if (path[i] == 'N') ny++;
                if (path[i] == 'W') nx++;
                if (path[i] == 'E') nx--;

                List<Integer> e1 = new ArrayList<>();
                e1.add(x);
                e1.add(y);
                e1.add(nx);
                e1.add(ny);

                List<Integer> e2 = new ArrayList<>();
                e2.add(nx);
                e2.add(ny);
                e2.add(x);
                e2.add(y);

                if (visited.contains(e1) || visited.contains(e2)) {
                    tmp += 1;
                } else {
                    tmp += 5;
                    visited.add(e1);
                    visited.add(e2);
                } 

                x = nx;
                y = ny;
            }
            ans.append(tmp).append('\n');
        }
        System.out.print(ans);
    }
}

