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
t = int(input())
while t>0:
	t-=1
	s = input()
	ans=0
	path=set()
	x1,y1,x2,y2=0,0,0,0
	ans=0
	for i in s:
		x1=x2
		y1=y2
		if i=='N':
			y2+=1
		elif i=='S':
			y2-=1
		elif i=='E':
			x2+=1
		elif i=='W':
			x2-=1
		p1 = str(x1)+" "+str(y1)+" "+str(x2)+" "+str(y2)
		p2 = str(x2)+" "+str(y2)+" "+str(x1)+" "+str(y1)
		if(p1 in path or p2 in path):
			ans+=1
		else:
			ans+=5
			path.add(p1)
	print(ans)