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
def eprint(*args):
    print(*args, file=sys.stderr)
zz=1
if zz:
	input=sys.stdin.readline
else:	
	sys.stdin=open('input.txt', 'r')
	sys.stdout=open('all.txt','w')
t=int(input())
while t>0:
	t-=1
	s=list(input().rstrip())
	d={}
	h,v=0,0
	c=0
	for i in s:
		p,q=h,v
		if i=='E':
			h-=1
		if i=='W':
			h+=1
		if i=='N':
			v-=1
		if i=='S':
			v+=1

		f=str(p)+"*"+str(q)+"*"+str(h)+"*"+str(v)
		f2=str(h)+"*"+str(v)+"*"+str(p)+"*"+str(q)
		if f in d :
			c+=1
		else:
			c+=5
			d[f]=1
			d[f2]=1
	print(c)							