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
# coding: utf-8
# Your code here!
for _ in range(int(input())):
    a = {}
    s = input()
    x = 0
    y = 0
    ans = 0
    for c in s:
        prevx = x
        prevy = y
        if(c=='N'):
            x+=1
        elif(c=='S'):
            x-=1
        elif(c=='W'):
            y-=1
        else:
            y+=1
        
        if(prevx>x):
            d = 0
            dd = 1
        elif(prevx<x):
            d = 1
            dd = 0
        elif(prevy>y):
            d = 2
            dd = 3
        else:
            d = 3
            dd = 2
        
        if 4*(1000000*x+y)+d in a.keys():
            ans+=1
        else:
            ans+=5
            a[4*(1000000*x+y)+d] = 1
            a[4*(1000000*prevx+prevy)+dd] = 1
    print(ans)
