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
t = int(input())
Q = []
for j in range(t):
    s = input()
    D = dict()
    x = 0
    y = 0
    p = x
    q = y
    Sum = 5 * len(s)  # длина пути без повторений
    for i in range(len(s)):
        if s[i] == 'N':
            y += 1
        elif s[i] == 'S':
            y -= 1
        elif s[i] == 'W':
            x -= 1
        else:
            x += 1
        flag1 = 0
        if (x, y) in D:  # если от этой точки я стартовал
            for elem in D[(x, y)]:  # ищу был ли путь в p q
                if elem == (p, q):
                    Sum -= 4
                    flag1 += 1  # значит здесь я уже ходил и больше сумму не считаю

        B = set()
        if (p, q) not in D:  # если с этой точки не стартовал, то запишу путь
            D[(p, q)] = B
            B.add((x, y))
        else:  # если стартовал, все-равно запишу + проверю, ходил ли я этим маршрутом
            flag = 0
            if flag1 == 0:
                for elem in D[(p, q)]:
                    if elem == (x, y):
                        Sum -= 4
                        flag += 1
            if flag == 0:
                D[(p, q)].add((x, y))

        p = x
        q = y
    Q.append(Sum)


for m in range(len(Q)):
    print(Q[m])