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
"""
Solution to Codeforces Problem 1351C : https://codeforces.com/problemset/problem/1351/C

Difficulty: 1400
"""
from collections import defaultdict


def solve(path):
    x, y, count = 0, 0, 0
    stored = defaultdict(lambda: defaultdict(lambda: ""))

    for p in path:
        new_x = x + 1 if p == "E" else x - 1 if p == "W" else x
        new_y = y + 1 if p == "N" else y - 1 if p == "S" else y

        x_pos, y_pos = (x + new_x)/2, (y + new_y)/2
        x, y = new_x, new_y

        count += 1

        if p not in stored[x_pos][y_pos]:
            count += 4
            stored[x_pos][y_pos] += "NS" if p in "NS" else "WE"

    return count


for _ in range(int(input())):
    print(solve(input()))
