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.*;
import java.lang.*;
import java.io.*;
 
 public class CF {
    public static void main (String[] args) {
	Scanner sc=new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();

        while (n-- > 0) {
            String s = sc.nextLine(); 
            //System.out.println("Here with " + s);
            Set<String> set = new HashSet<>();
            int x = 0, y = 0, ret = 0;

            for (char c: s.toCharArray()) {
                int prevX = x, prevY = y;
                x += (c == 'E') ? 1 : 0;
                x += (c == 'W') ? -1 : 0;
                y += (c == 'N') ? 1 : 0;
                y += (c == 'S') ? -1 : 0;
                String key1 = prevX + ":" + prevY + ":" + x + ":" + y; 
                String key2 = x + ":" + y + ":" + prevX + ":" + prevY;
                if (set.contains(key1) || set.contains(key2)) ret += 1; 
                else ret += 5; 
                set.add(key1);
                set.add(key2);
            }
            System.out.println(ret);
        }

    }
}

