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
from sys import stdin
a = int(stdin.readline())

for b in range(0,a):
    startx=0
    starty=0
    A=set()
    B=stdin.readline()
    sum=0
    for k in range(0,len(B)-1):
        if B[k]=='N':
            starty+=1
        if B[k]=='S':
            starty-=1
        if B[k]=='E':
            startx+=1
        if B[k]=='W':
            startx-=1

        ll=len(A)
        if B[k]=='N' or B[k]=='S':
            if B[k]=='N':
               A.add((1,startx,starty))
            elif B[k]=='S':
               A.add((1,startx,starty+1))

        elif B[k]=='E' or B[k]=='W':
            if B[k]=='E':
               A.add((-1,startx,starty))
            elif B[k]=='W':
               A.add((-1,startx+1,starty))

        if len(A)!=ll:
           sum+=5
        else:
           sum+=1
    print(sum)