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

##for _ in range(int(input())):
##    a,b=map(int,input().split())
##    if(a>b):
##        a,b=b,a
##    c,d=map(int,input().split())
##    if(c>d):
##        c,d=d,c
##    if(c==a):
##        if(b+d==c):
##            print("YES")
##        else:
##            print("NO")
##    if(b==d):
##        if(c+a==b):
##            print("YES")
##        else:
##            print("NO")

from collections import defaultdict as dd   
for _ in range(int(input())):
    s1=input()
    x=0
    y=0
    px=0
    py=0
    s=0
    d=dd(int)
    
    for i in range(len(s1)):
        if(s1[i]=="N"):
            y+=1
            g=[(x,y),(px,py)]
            g.sort()
            g=tuple(g)
            if( d[g]==-1):
##                print(d[g],g)
                s+=1
            else:
                s+=5
                
                d[g]=-1
                
        elif(s1[i]=="S"):
            y-=1
            g=[(x,y),(px,py)]
            g.sort()
            g=tuple(g)
            if( d[g]==-1):
##                print(d[g],g)
                s+=1
                
            else:
                s+=5
                d[g]=-1
        elif(s1[i]=="W"):
            x-=1
            g=[(x,y),(px,py)]
            g.sort()
            g=tuple(g)
            if( d[g]==-1):
##                print(d[g],g)
                s+=1
            else:
                s+=5
                d[g]=-1
        else:
            x+=1
            g=[(x,y),(px,py)]
            g.sort()
            g=tuple(g)
            if( d[g]==-1):
##                print(d[g],g)
                s+=1
            else:
                s+=5
                d[g]=-1
        px=x
        py=y
    print(s)
        
            
            
