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
# skier.py
from collections import defaultdict
for _ in range(int(input())):
    s = input()
    visited = dict()
    visited = defaultdict(lambda:False,visited)

    x = 0
    y = 0
    cost = 0
    # visited[(x,y,'E')] = True
    # visited[(x,y,'W')] = True
    # visited[(x,y,'N')] = True
    # visited[(x,y,'E')] = True
    for i in s:
        if i == 'E':
            if visited[(x+1,y,'E')] or visited[(x,y,'W')]:
                cost+=1
            else:
                visited[(x+1,y,'E')] = True
                visited[(x,y,'W')] = True
                cost+=5
            x+=1

        elif i == 'W':
            if visited[(x-1,y,'W')] or visited[(x,y,'E')]:
                cost+=1
            else:
                visited[(x-1,y,'W')] = True
                visited[(x,y,'E')] = True
                cost+=5
            x-=1
        
        elif i == 'N':
            if visited[(x,y+1,'N')] or visited[(x,y,'S')]:
                cost+=1
            else:
                visited[(x,y+1,'N')] = True
                visited[(x,y,'S')] = True
                cost+=5
            y+=1

        elif i == 'S':
            if visited[(x,y-1,'S')] or visited[(x,y,'N')]:
                cost+=1
            else:
                visited[(x,y-1,'S')] = True
                visited[(x,y,'N')] = True
                cost+=5
            y-=1

        # print(cost,visited[(x,y,i)])
    # print(visited[(0,1,'N')])
    # print(visited[(0,1,'S')])
    print(cost)
        