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
for case in range(int(input())):
    x1 = y1 = 0
    visited_path = set()
    time = 0
    path = input()
    for c in path:
        x0 = x1
        y0 = y1
        if c == 'W': x1 -= 1
        elif c == 'E': x1 += 1
        elif c == 'N': y1 += 1
        else:   y1 -= 1
        A = (x0, y0)
        B = (x1, y1)
        if (A, B) not in visited_path or (B, A) not in visited_path:
            visited_path.add((A, B))
            visited_path.add((B, A))
            time += 5
        else: time += 1
    print(time)