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
def solve(str):
    x = 0
    y = 0
    prevX = 0
    prevY = 0
    map = set([(x, y, prevX, prevY)])
    time = 0
    for c in str:
        prevX = x
        prevY = y

        if c == 'N':
            y = y + 1
        elif c == 'S':
            y = y - 1
        elif c == 'W':
            x = x - 1
        elif c == 'E':
            x = x + 1

        if (x, y, prevX, prevY) in map or (prevX, prevY, x, y) in map:
            time = time + 1
        else:
            time = time + 5
        map.add((x, y, prevX, prevY))
    
    return time


t = int(input())
for i in range(0, t):
    s = input()
    print(solve(s))