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

public class Main {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        
        int T = Integer.parseInt(sc.next());
        StringBuilder sb = new StringBuilder();
        for(int t = 0; t < T; t++){
            String s = sc.next();
            int x2 = 0;
            int y2 = 0;
            Set<String> set = new HashSet<>();
            int ans = 0;
            for(int i = 0; i < s.length(); i++){
                int x1 = x2;
                int y1 = y2;
                switch (s.charAt(i)) {
                    case 'S':
                        y2--;
                        
                        break;
                    case 'N':
                        y2++;
                        
                        break;
                    case 'W':
                        x2--;
                        break;
                    case 'E':
                        x2++;
                        break;
                }
                if(s.charAt(i) == 'S' || s.charAt(i) == 'W'){
                    if(set.add(String.valueOf(x1) + " " + String.valueOf(y1)
                            + " " + String.valueOf(x2) + " " + String.valueOf(y2))){
                        ans += 5;
                    }else{
                        ans += 1;
                    }
                }else{
                    if(set.add(String.valueOf(x2) + " " + String.valueOf(y2)
                            + " " + String.valueOf(x1) + " " + String.valueOf(y1))){
                        ans += 5;
                    }else{
                        ans += 1;
                    }
                }
            }
            sb.append(ans).append(System.lineSeparator());
        }
        System.out.print(sb);
    }
}