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
import sys
import os

debug = True
if debug and os.path.exists("input.in"):
    input = open("input.in", "r").readline
else:
    input = sys.stdin.readline


def inp():
    return (int(input()))


def inlt():
    return (list(map(int, input().split())))


def insr():
    s = input()
    return (list(s[:len(s) - 1]))


def invr():
    return (map(int, input().split()))

def getPath(x1, y1, x2, y2):
    return format((x1, y1, x2, y2))

test_count = int(input())
for t in range(test_count):
    moves = insr()
    cost = 0
    paths = set()
    startX, startY, endX, endY = (0, 0, 0, 0)
    for move in moves:
        startX = endX
        startY = endY
        if move == "N":
            endY = startY + 1
        elif move == "S":
            endY = startY - 1
        elif move == "E":
            endX = startX + 1
        else:
            endX = startX - 1
        segment1 = getPath(startX, startY, endX, endY)
        segment2 = getPath(endX, endY, startX, startY)
        # print(segment1, segment2)
        # print(paths)
        if segment1 in paths or segment2 in paths:
            cost += 1
        else:
            cost += 5
            paths.add(getPath(startX, startY, endX, endY))
    print(cost)


