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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class C1351 {
    public static void main(String[] args) throws IOException {
        new C1351().run();
    }

    private void run() throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        int t = Integer.parseInt(reader.readLine());

        while(t-- > 0){
            String s = reader.readLine();

            int n = s.length();
            int i= 0;
            int count = 0;

            Set<String> set = new HashSet<>();

            int curr_x = 0;
            int curr_y = 0;
            int new_x=0, new_y=0;
            while(i<n) {

                //set.add(curr_x+"_"+curr_y);
                char ch = s.charAt(i);

                switch (ch) {
                    case 'E': new_x = curr_x+5; new_y = curr_y; break;
                    case 'W': new_x = curr_x-5; new_y = curr_y; break;
                    case 'N': new_x = curr_x; new_y = curr_y+5; break;
                    case 'S': new_x = curr_x; new_y = curr_y-5; break;
                }
                if(set.contains(new_x+"_"+new_y+"_"+curr_x+"_"+curr_y) || set.contains(curr_x+"_"+curr_y+"_"+new_x+"_"+new_y)){
                    count+=1;
                }
                else{
                    count+=5;
                }
                set.add(curr_x+"_"+curr_y+"_"+new_x+"_"+new_y);
                curr_x = new_x;
                curr_y = new_y;

                i++;
            }
            System.out.println(count);
        }
    }
}
