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
# cook your dish here
t = int(input())

for o in range(t):
    s = input()
    c = 0
    x = 0
    y = 0
    a = set()
    for i in s:
        if i == 'E':
            b = ((x,y),(x+1,y))
            d = ((x+1,y),(x,y))
            x += 1
        elif i == 'W':
            b = ((x,y),(x-1,y))
            d = ((x-1,y),(x,y))
            x -= 1
        elif i == 'S':
            b = ((x,y),(x,y-1))
            d = ((x,y-1),(x,y))
            y -= 1
        else:
            b = ((x,y),(x,y+1))
            d = ((x,y+1),(x,y))
            y += 1
        # u = 0
        # for j in a:
        #     if (b[0] == j[0] and b[1] == j[1]) or (b[0] == j[1] and b[1] == j[0]):
        #         c += 1
        #         u = 1
        # if(u == 0):
        #     c += 5
        if b in a or d in a:
            c += 1
        else:
            c += 5
        a.add(b)
        
    print(c)
        