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
import sys

__author__ = 'ratmir'

from collections import deque

alphabet = "abcdefghijklmnopqrstuvwxyz"


def solve(n, a, graph):
    return 1


def execute():
    [t] = [int(x) for x in sys.stdin.readline().split()]
    for ti in range(0, t):
        path = sys.stdin.readline()[:-1]
        deltas = {"N":[0,-1],"S":[0,1],"W":[-1,0],"E":[1,0]}
        visited = set([(0,0)])
        amount = 0
        x = 0
        y = 0
        for i in range(0,len(path)):
            delta = deltas[path[i]]

            nx = x + delta[0]
            ny = y + delta[1]
            if (x, y, nx, ny) not in visited:
                visited.add((x,y,nx,ny))
                visited.add((nx,ny,x,y))
                amount +=5
            else:
                amount += 1
            x = nx
            y = ny
        print str(amount)


execute()
