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
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
GETA=123
###############################################################################
for _ in range(int(input())):
    s=input()
    A=set()
    x=0
    y=0
    d=0
    prev=(0,0)
    for e in s:
        if e=="N":
            y+=1
        elif e=="S":
            y-=1
        elif e=="E":
            x+=1
        else:
            x-=1
        path=(prev[0],x,prev[1],y)
        path2=(x,prev[0],prev[1],y)
        path3=(prev[0],x,y,prev[1])
        path4=(x,prev[0],prev[1],y)
        if path in A or path2 in A or path3 in A or path4 in A:
            d+=1
        else:
            d+=5
            A.add(path)
        prev=(x,y)
    print(d)
