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 reverse_direction(direct):
    if direct == "N":
        return "S"
    if direct == "S":
        return "N"
    if direct == "W":
        return "E"
    return "W"


for _ in range(int(input())):
    tmp = input()
    path = 0
    coord = (0, 0)
    prices = {coord: {}}
    for direction in tmp:
        if direction not in prices[coord]:
            prices[coord][direction] = 5
        current_price = prices[coord][direction]
        prices[coord][direction] = 1
        path += current_price
        if direction == "N":
            coord = (coord[0], coord[1] + 5)
        elif direction == "S":
            coord = (coord[0], coord[1] - 5)
        elif direction == "W":
            coord = (coord[0] - 5, coord[1])
        else:
            coord = (coord[0] + 5, coord[1])
        if coord in prices:
            prices[coord][reverse_direction(direction)] = 1
        else:
            prices[coord] = {reverse_direction(direction): 1}
    print(path)
