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

def solve_test_case(t):
    s = str(input())

    pos = (0, 0)
    t = 0

    paths_performed_past = set()

    for i in range(len(s)):
        # print(paths_performed_past)
        action = s[i]
        if action == "N":
            diff = (1, 0)
        elif action == "S":
            diff = (-1, 0)
        elif action == "E":
            diff = (0, 1)
        else:
            diff = (0, -1)

        new_pos = (pos[0] + diff[0], pos[1] + diff[1])

        elt = (pos, new_pos)
        if (pos, new_pos) in paths_performed_past or (new_pos, pos) in paths_performed_past:
            t += 1
        else:
            paths_performed_past.add(elt)
            t += 5

        pos = new_pos

    print(t)



def parse_array(f):
    return list(map(f, input().split()))

def solve():
    T = int(input())

    for t in range(T):
        solve_test_case(t)

if __name__ == "__main__":
    solve()
