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
# alpha = "abcdefghijklmnopqrstuvwxyz"
# prime = 1000000007#998244353 
# INF = 10000

# from sys import stdout
# from heapq import heappush, heappop
# from collections import defaultdict
# from collections import deque 
# import bisect 

# from math import sqrt    
# from math import gcd
# from math import log2

# with open('input.in','r') as Reader:
#     with open('output.out','w') as out:
        # n = int(Reader.readline())

    
# print(len(arr))
# print(arr[:10])


t = int(input())
for test in range(t):
    # n = int(input())
    # n, m = list(map(int, input().split()))
    # n2, m2 = list(map(int, input().split()))
    s = input()
    v = set()
    start = 0
    ans = 0
    cur = [0, 0, 0, 0]
    for i in s:
        if i=="N":
            cur[2] += 1
        elif i=="S":
            cur[2] -= 1
        elif i == "E":
            cur[3] += 1
        else:
            cur[3] -= 1

        key1 = str(cur)
        key2 = str([cur[2],cur[3], cur[0], cur[1]])
        if key1 in v:
            ans += 1
        else:
            ans += 5
        
        v.add(key1)
        v.add(key2)

        cur[0] = cur[2]
        cur[1] = cur[3]
    print(ans)