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
n=int(input())

for i in range(n):
    s=input()
    visited=set()
    g=[[1,0],[0,1],[0,-1],[-1,0]]
    start=[0,0]
    ans=0
    for k in s:
        pair1=(start[0],start[1])
        if k=="N":
            start[0]+=g[0][0]
            start[1]+=g[0][1]
        if k=="S":
            
            start[0]+=g[3][0]
            start[1]+=g[3][1]
        if k=="E":
            
            start[0]+=g[1][0]
            start[1]+=g[1][1]
        if k=="W":
            
            start[0]+=g[2][0]
            start[1]+=g[2][1]
        pair2=(start[0],start[1])
        pair=((pair2[0]+pair1[0])/2,(pair2[1]+pair1[1])/2)
        if pair not in visited:
            visited.add(pair)
            ans+=5
        else:
            ans+=1
        #print(visited)
    print(ans)
    
        
    
