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

for t in range(int(sys.stdin.readline())):
	
	ans = 0

	ways = set()
	x, y = 0, 0
	a = sys.stdin.readline()[:-1]
	for ch in a:

		x0, y0 = x, y
		if ch == 'W':
			x0 += 1
		elif ch == 'E':
			x0 -= 1
		elif ch == 'N':
			y0 += 1 
		else:
			y0 -= 1

		if x > x0:
			x1, x2 = x0, x
		else:
			x2, x1 = x0, x

		if y > y0:
			y1, y2 = y0, y
		else:
			y2, y1 = y0, y

		if (x1, x2, y1, y2) in ways:
			ans += 1
		else:
			ans += 5
			ways.add((x1, x2, y1, y2))
		
		x = x0
		y = y0


	sys.stdout.write("{}\n".format(ans))
