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
LI=lambda:list(map(int, sys.stdin.readline().strip('\n').split()))
MI=lambda:map(int, sys.stdin.readline().strip('\n').split())
SI=lambda:sys.stdin.readline().strip('\n')
II=lambda:int(sys.stdin.readline().strip('\n'))

for _ in range(II()):
	done={}
	x, y, ans=0, 0, 0
	for c in SI():
		xx, yy=x, y
		if c=='N':
			yy+=1
		elif c=='S':
			yy-=1
		elif c=='W':
			xx-=1
		else:
			xx+=1
		p=str(x)+str(',')+str(y)+'-'+str(xx)+str(',')+str(yy)
		pp=str(xx)+str(',')+str(yy)+'-'+str(x)+str(',')+str(y)
		if done.get(p, False) or done.get(pp, False):
			ans+=1
		else:
			ans+=5
		done[p]=done[pp]=True
		x, y=xx, yy
	print(ans)