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

public class trying {

    class Node{

    }
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        sc.nextLine();
        for(int i=0; i<t ; i++){
            char[] chars = sc.nextLine().toCharArray();
            HashSet<Pair<Pair<Integer,Integer>, Pair<Integer,Integer>>> paths = new HashSet<>(chars.length);
            int currX = 0;
            int currY = 0;
            int nextX = 0;
            int nextY = 0;
            int total = 0;
            for(char c: chars){
                switch (c){
                    case 'N':
                    {
                        nextY = currY+1;
                    }
                    break;
                    case 'S':
                    {
                        nextY = currY-1;
                    }
                    break;
                    case 'W':
                    {
                        nextX = currX-1;
                    }
                    break;
                    case 'E':
                    {
                        nextX = currX+1;
                    }
                    break;
                }
                Pair<Integer, Integer> curr = new Pair<>(currX, currY);
                Pair<Integer, Integer> next = new Pair<>(nextX, nextY);
                if(paths.contains(new Pair<>(curr,next)) || paths.contains(new Pair<>(next, curr))){
                    total+=1;
                }
                else {
                    total+=5;
                    paths.add(new Pair<>(curr,next));
                    paths.add(new Pair<>(next,curr));
                }
                currX = nextX;
                currY = nextY;
            }
            System.out.println(total);
        }

    }

}
