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
moves={'N':lambda x,y:(x,y+1),
       'S':lambda x,y:(x,y-1),
       'E':lambda x,y:(x+1,y),
       'W':lambda x,y:(x-1,y)}


t=int(input())
for _ in range(t):
    s=input()
    visited=set() #(x1,y1,x2,y2)
    
    cnt=0
    x=y=0
    for c in s:
        x2,y2=moves[c](x,y)
        seg1=(x,y,x2,y2)
        seg2=(x2,y2,x,y)
        if seg1 not in visited and seg2 not in visited:
            cnt+=5
            visited.add(seg1)
        else:
            cnt+=1
        x,y=x2,y2
    print(cnt)