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
import math
from  collections import defaultdict

# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')

def solve(test):
	s = input()
	up, down, left, right = 0, 0, 0, 0
	ans = 0
	rec = {}
	hor, ver = 0, 0
	for i in s:
		og = (hor, ver)
		if i == 'N':
			ver += 1
		elif i == 'S':
			ver -= 1
		elif i == 'E':
			hor += 1
		else:
			hor -= 1
		if (hor, ver, og[0], og[1]) in rec:
			ans += 1
		else:
			rec[(hor, ver, og[0], og[1])] = 1
			rec[(og[0], og[1], hor, ver)] = 1
			ans += 5
	print(ans)


if __name__ == "__main__":
	test_cases = int(input())
	for t in range(1, test_cases + 1):
		solve(t)
