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
def solve(s):


    req_set = set(s)

    if len(req_set)==1:
        return 5*len(s)

    req_list = list(s)

    cost=0
    
    x,y=(0,0)
    px,py=(x,y)
    path={}

    for i in range(len(req_list)):

        if req_list[i]=="N":
            y+=1
        elif req_list[i]=="S":
            y-=1

        elif req_list[i]=="W":
            x-=1
        
        else:
            x+=1

        if path.get(((px,py),(x,y))) or path.get(((x,y),(px,py))):
            cost+=1
            
        else:
            path[((px,py),(x,y))]=1
            path[((x,y),(px,py))]=1

            cost+=5
        px,py=(x,y)

    return cost


T=int(input())

for _ in range(T):

    s=input()

    print(solve(s))