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 bisect import bisect_left,insort
for _ in range(input()):
    s=raw_input()
    d={}
    x=0
    y=0
    sz=0
    val=0
    for i in range(len(s)):
        px,py=x,y
        if s[i]=='S':
            y-=1
        elif s[i]=='N':
            y+=1
        elif s[i]=='E':
            x+=1
        else:
            x-=1
        l=[min(px,x),max(x,px),min(y,py),max(y,py)]
        x1=''
        for i in l:
            x1+=str(i)
        l=x1
        d[l]=d.get(l,0)
        if d[l]==0:
            val+=5
            d[l]=1
        else:
            val+=1
    print val
            
    
        
    
