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
# The (x,y) moves 
direct = {'N':(0,1),'S':(0,-1),'W':(-1,0),'E':(1,0) }
def solve(path):
    visited,begin,time = set(),[0,0],0
    for p in path:
        # Get the next position
        nxt = direct[p]
        # Specify the edge and be strict with its direction
        interim = (begin[0] + nxt[0], begin[1] + nxt[1])
        interim2 = tuple(begin)
        p1 = min(interim,interim2); p2 = max(interim,interim2)
        edge = (p2[0],p2[1],p1[0],p1[1])
        if edge not in visited:
            time += 5; visited.add(edge)
        else: time += 1
        begin[0]+=nxt[0]; begin[1]+=nxt[1]
    print(time)
for _ in range(int(input())):
    solve(input())