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


def alternate(start_x, start_y, char):
    if char == "N":
        return (start_x, start_y + 1)
    if char == "S":
        return (start_x, start_y - 1)
    if char == "E":
        return (start_x + 1, start_y)
    if char == "W":
        return (start_x - 1, start_y)


def solve(s):
    visited = {}
    start_x = 0
    start_y = 0
    result = 0

    for char in s:
        if (start_x, start_y) in visited and char in visited[(start_x, start_y)]:
            result += 1
        else:
            result += 5

        if not (start_x, start_y) in visited:
            visited[(start_x, start_y)] = set()
        visited[(start_x, start_y)].add(char)
        alt = alternate(start_x, start_y, char)
        if not (alt) in visited:
            visited[alt] = set()
        visited[alt].add(reverse(char))

        if char == "N":
            start_y += 1
        elif char == "S":
            start_y -= 1
        elif char == "E":
            start_x += 1
        elif char == "W":
            start_x -= 1
    return result


if __name__ == "__main__":
    for i in range(int(input())):
        s = input()
        print(solve(s))