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
from collections import defaultdict

def dist(s):
    dic=defaultdict(int) 
    p=[0,0]
    res=0
    for c in s:
        t=p[:]
        if c=='E':
            t[0]=p[0]+1
        elif c=='W':
            t[0]=p[0]-1
        elif c=='N':
            t[1]=p[1]+1
        else:
            t[1]=p[1]-1
        d1=(p[0],p[1],t[0],t[1])
        d2=(t[0],t[1],p[0],p[1])
        if d1 in dic:
            res+=1
        else:
            res+=5
            dic[d2]+=1
            dic[d1]+=1
        p[0]=t[0]
        p[1]=t[1]
    return res
            
        
   
    

t=int(input())
while t:
    s=input()
    print(dist(s))
    t-=1