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():
    a = input()
    x = 0
    y = 0
    W = set()
    ans = 0
    for i in range(len(a)):
        px = x
        py = y
        if (a[i] == 'W'):
            x -= 1
        if (a[i] == 'E'):
            x += 1
        if (a[i] == 'S'):
            y -= 1
        if (a[i] == 'N'):
            y += 1
        par1 = (px, py)
        par2 = (x, y)
        if (par1 < par2):
            par1, par2 = par2, par1
        par3 = (par1, par2)
        if (par3 in W):
            ans += 1
        else:
            ans += 5
        W.add(par3)
    print(ans)


t = int(input())
while (t > 0):
    solve()
    t -= 1
