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
from collections import defaultdict
mo=[(1,0),(0,1),(-1,0),(0,-1)]
m={'S':0,'N':2,'E':1,'W':3}
t=int(input())
def do(i):
	if i==0:return(2)
	if i==2:return(0)
	if i==1:return(3)
	return(1)

for _ in range(t):
	s=str(input())
	vi=defaultdict(lambda:[False,False,False,False])
	vi.clear()
	ans=0
	now=(0,0)
	for i in s:	
		d=do(m[i])
		vi[now][d]=True
		now=(now[0]+mo[m[i]][0],now[1]+mo[m[i]][1])
		if vi[now][m[i]]:
			ans+=1
		else:
			ans+=5
			vi[now][m[i]]=True
	print(ans)
