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
# Skier 
class path(object):
	def __init__(self,beg,end):
		self.p = {beg,end}

t = int(input())

for i in range(0,t):
	cost = 0
	x = list(input())
	road = {None}
	curr_x = 0
	curr_y = 0
	prv = (0,0)
	for j in range(0,len(x)):
		px = 0
		py = 0
		if x[j] == 'N':
			py += 1
		elif x[j] == 'S':
			py -= 1
		elif x[j] == 'W':
			px -= 1
		else:
			px += 1
		curr_x += px
		curr_y += py
		temp = (curr_x,curr_y)
		temp_path = frozenset({prv,temp})
		#temp_path = path(prv,temp)
		#print(prv,temp,temp_path.p,sep=" || ")
		#print(road)
		if temp_path in road:
			cost += 1
			#print("came here")
		else:
			road.add(temp_path)
			cost += 5
		prv = temp 
	print(cost)

# This code works fine, but the time complexity is little high
# I need to use some other data structure other than list 
# for storing the pre-travelled paths 
