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
a=int(input())
for i in range(a):
    s=input()
    al=defaultdict(int)
    ore=(str(0),str(0))
    x=0
    y=0
    total=0
    for i in range(len(s)):
        if(s[i]=='N'):
            x+=1
        if(s[i]=='E'):
            y+=1
        if(s[i]=='W'):
            y-=1
        if(s[i]=='S'):
            x-=1
        dest=(str(y),str(x))
        p1=(ore,dest)
        p2=(dest,ore)
      
        if(al[p1]==1 or al[p2]==1):
            total+=1
        else:
            al[p1]=1
            al[p2]=1
            total+=5
        ore=dest
    print(total)
        
