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
#!/usr/bin/python3

# Codeforces - Testing Round 16
# Problem C - Skier


def read_int():
	n = int(input())
	return n


def read_ints():
	ints = [int(x) for x in input().split(" ")]
	return ints
	

#---

def solve(chars):
	x0 = 0
	y0 = 0
	paths = set()
	
	time = 0
	for c in chars:
		if c == 'N':
			y = y0 + 1
			x = x0
			
		if c == 'S':
			y = y0 - 1
			x = x0
			
		if c == 'E':
			x = x0 + 1
			y = y0
			
		if c == 'W':
			x = x0 - 1
			y = y0
			
		path = (x0, y0, x, y)
		path_mir = (x, y, x0, y0)
		
		if path in paths or path_mir in paths:
			time += 1
		else:
			time += 5
			
		paths.add(path)
		x0 = x
		y0 = y
	
	return time


# Main
t = read_int()
for case in range(t):
	chars = input()
	sol = solve(chars)
	
	print (sol)
