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
if __name__ == '__main__':
	n = int(input())
	for i in range(n):
		s = input()
		m = {}
		cur = [0,0]
		ans=0
		for c in s:
			if c == 'N':
				if (cur[0],cur[1]) in m and 'N' in m[(cur[0],cur[1])]:
					ans+=1
				elif (cur[0]+1,cur[1]) in m and 'S' in m[(cur[0]+1,cur[1])]:
					ans+=1
				else:
					ans+=5
				if (cur[0],cur[1]) in m:
					m[(cur[0],cur[1])].add('N')
				else:
					m[(cur[0],cur[1])] = {'N'}
				cur[0] = cur[0] + 1
			elif c=='S':
				if (cur[0],cur[1]) in m and 'S' in m[(cur[0],cur[1])]:
					ans+=1
				elif (cur[0]-1,cur[1]) in m and 'N' in m[(cur[0]-1,cur[1])]:
					ans+=1
				else:
					ans+=5
				if (cur[0],cur[1]) in m:
					m[(cur[0],cur[1])].add('S')
				else:
					m[(cur[0],cur[1])] = {'S'}
				cur[0] = cur[0] - 1
			elif c=='E':
				if (cur[0],cur[1]) in m and 'E' in m[(cur[0],cur[1])]:
					ans+=1
				elif (cur[0],cur[1]+1) in m and 'W' in m[(cur[0],cur[1]+1)]:
					ans+=1
				else:
					ans+=5
				if (cur[0],cur[1]) in m:
					m[(cur[0],cur[1])].add('E')
				else:
					m[(cur[0],cur[1])] = {'E'}
				cur[1] = cur[1] + 1
			elif c=='W':
				if (cur[0],cur[1]) in m and 'W' in m[(cur[0],cur[1])]:
					ans+=1
				elif (cur[0],cur[1]-1) in m and 'E' in m[(cur[0],cur[1]-1)]:
					ans+=1
				else:
					ans+=5
				if (cur[0],cur[1]) in m:
					m[(cur[0],cur[1])].add('W')
				else:
					m[(cur[0],cur[1])] = {'W'}
				cur[1] = cur[1] - 1
		print(ans)
