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
q = int(input())
dupa = 3
for _ in range(q):
	s = input()
	odc = []
	cur = [0,0]
	n = len(s)
	for i in range(n):
		prev = cur.copy()
		if s[i] == 'N':
			cur[1] += 1
		if s[i] == 'S':
			cur[1] -= 1
		if s[i] == 'W':
			cur[0] -= 1
		if s[i] == 'E':
			cur[0] += 1
		pyk = [[cur[0],cur[1]],[prev[0],prev[1]]]
		if pyk[0] > pyk[1]:
			a = pyk[0]
			b = pyk[1]
			pyk = [b,a]
		odc.append(pyk)
	odc.sort()
	wyn = 5
	for i in range(1,n):
		if odc[i] == odc[i-1]:
			wyn += 1
		else:
			wyn += 5
	print(wyn)