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
# cook your dish here
import sys
import math
from collections import defaultdict
mod=1000000007
T=1
T=int(sys.stdin.readline())
for _ in range(T):
    s=input()
    d={}
    ans=0
    x,y=0,0
    for i in s:
        nx,ny=x,y
        if(i=='N'):
            ny+=1
        elif i=='S':
            ny-=1
        elif i=='W':
            nx-=1
        else :
            nx+=1
        #print(d)
        if((x,y) in d and (nx,ny) in d[(x,y)]):
            ans+=1
        else:
            ans+=5
            if (nx,ny) not in d:
                d[(nx,ny)]=[(x,y)]
            else:
                d[(nx,ny)].append((x,y))
            if (x,y) not in d:
                d[(x,y)]=[(nx,ny)]
            else:
                d[(x,y)].append((nx,ny))
        #print(nx,ny,ans)
        x,y=nx,ny
    print(ans)
        
