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 collections

class Position:
    __slots__ = ('x', 'y')
    
    def __init__(self, x, y):
        self.x = x
        self.y = y

    def __eq__(self, other):
        return self.x == other.x and self.y == other.y
        
    def __hash__(self):
        return hash((self.x, self.y))
    
    def __repr__(self):
        return 'Position(x={}, y={})'.format(self.x, self.y)

def path_duration(path):
    """
    x right >
    y up ^
    """
    
    position = Position(0, 0)
    position_paths = collections.defaultdict(list)
    duration = 0
    for direction in path:
        if direction == 'S':
            new_position = Position(position.x, position.y - 1)
        elif direction == 'N':
            new_position = Position(position.x, position.y + 1)
        elif direction == 'W':
            new_position = Position(position.x - 1, position.y)
        elif direction == 'E':
            new_position = Position(position.x + 1, position.y)
        
        if new_position in position_paths.get(position, []):
            speed = 1
        else:
            speed = 5
        
        duration += speed
        
        position_paths[position].append(new_position)
        position_paths[new_position].append(position)
        
        position = new_position
    return duration

def main():
    t = int(input())
    for _ in range(t):
        path = input()
        print(path_duration(path))

assert path_duration('NNN') == 15
assert path_duration('NS') == 6
assert path_duration('WWEN') == 16
assert path_duration('WWEE') == 12
assert path_duration('NWNWS') == 25
assert path_duration('ESWN') == 20
assert path_duration('WSESNN') == 26

main()

