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())

#MOVE FUNCTION TO UPDATE TUPLE
def move(position,direction):
    if direction=='N':
        x,y=position
        y=y+1
        position=(x,y)
    elif direction=='E':
        x,y=position
        x=x+1
        position=(x,y) 

    elif direction=='S':
        x,y=position
        y=y-1
        position=(x,y) 

    elif direction=='W':
        x,y=position
        x=x-1
        position=(x,y) 
    return position

def main():
    position = (0,0)
    x=1
    y=0
    #x is number of long travel (5 sec) and y is number of short travel(1 sec)
    path = input()
    relations = {'N':'S','S':'N','E':'W','W':'E'}
    traversal = {position:[path[0]]}
    position = move(position,path[0])
    for i in range(1,len(path)):
        destination = move(position,path[i])
        value = traversal.get(position)
        d_value = traversal.get(destination)
        if value is None:
            if d_value is None:
                x=x+1
                #destination has no values,newpath
            elif relations[path[i]] in d_value:
                y=y+1
                #destination has reverse path old 
            else:
                x=x+1
                #destination doesnt have reverse path new
            traversal[position]=[path[i]]
            position = destination
            
        else:
            if path[i] in value:
                y=y+1
                #current location has travelled old
            elif d_value is None:
                x=x+1
                #destination has no values,newpath
            elif relations[path[i]] in d_value:
                y=y+1
                #destination has reverse path old
            else:
                x=x+1
                #destination doesnt have reverse path new
            value.append(path[i])
            traversal[position]=value
            position = destination

    print(x*5+y)
            
for _ in range(T):
    main()