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
from collections import namedtuple

Delta = namedtuple('Delta', ['x', 'y'])
deltas = {"N": Delta(0, 1), "S": Delta(0, -1), "W": Delta(-1, 0), "E": Delta(1, 0)}

tc = int(input())
while tc > 0:
    traces = set()
    x1, y1 = 0, 0
    finish_time = 0
    for direction in input():
        delta = deltas.get(direction)
        x2, y2 = x1 + delta.x, y1 + delta.y
        if (x1, y1, x2, y2) in traces or (x2, y2, x1, y1) in traces:
            finish_time += 1
        else:
            finish_time += 5
            traces.add((x2, y2, x1, y1))
        x1, y1 = x2, y2
    print(finish_time)
    tc -= 1