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 process_test_case(i_test):
    path = input()
    bound = len(path)

    path_dict = {}
    n_sec = 0
    i = bound
    j = bound

    for c in path:
        if c == 'N':
            i_path = str(i) + str(i) + str(j) + str(j + 1)
            j += 1
        if c == 'S':
            i_path = str(i) + str(i) + str(j - 1) + str(j)
            j -= 1
        if c == 'E':
            i_path = str(i) + str(i + 1) + str(j) + str(j)
            i += 1
        if c == 'W':
            i_path = str(i - 1) + str(i) + str(j) + str(j)
            i -= 1

        if i_path in path_dict:
            n_sec += 1
        else:
            n_sec += 5
        path_dict[i_path] = True

    print(n_sec)
    return None


n_tests = int(input())
for i_test in range(1, n_tests + 1):
    process_test_case(i_test)
