The polar bears are going fishing. They plan to sail from (*s*<sub class="lower-index">*x*</sub>, *s*<sub class="lower-index">*y*</sub>) to (*e*<sub class="lower-index">*x*</sub>, *e*<sub class="lower-index">*y*</sub>). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or north. Assume the boat is currently at (*x*, *y*).
 -  If the wind blows to the east, the boat will move to (*x* + 1, *y*). -  If the wind blows to the south, the boat will move to (*x*, *y* - 1). -  If the wind blows to the west, the boat will move to (*x* - 1, *y*). -  If the wind blows to the north, the boat will move to (*x*, *y* + 1). 
Alternatively, they can hold the boat by the anchor. In this case, the boat stays at (*x*, *y*). Given the wind direction for *t* seconds, what is the earliest time they sail to (*e*<sub class="lower-index">*x*</sub>, *e*<sub class="lower-index">*y*</sub>)?
The first line contains five integers *t*, *s*<sub class="lower-index">*x*</sub>, *s*<sub class="lower-index">*y*</sub>, *e*<sub class="lower-index">*x*</sub>, *e*<sub class="lower-index">*y*</sub> (1 ≤ *t* ≤ 10<sup class="upper-index">5</sup>,  - 10<sup class="upper-index">9</sup> ≤ *s*<sub class="lower-index">*x*</sub>, *s*<sub class="lower-index">*y*</sub>, *e*<sub class="lower-index">*x*</sub>, *e*<sub class="lower-index">*y*</sub> ≤ 10<sup class="upper-index">9</sup>). The starting location and the ending location will be different.

The second line contains *t* characters, the *i*-th character is the wind blowing direction at the *i*-th second. It will be one of the four possibilities: "E" (east), "S" (south), "W" (west) and "N" (north).
count,X1,Y1,X2,Y2= map(int,input().split())
directions = input()

steps = 0
x1_next,y1_next = X1,Y1
x1_prev,y1_prev = X1,Y1
for i in directions:
	if [x1_next,y1_next] == [X2,Y2]:
		break
	if i == 'E':
		
		if abs(X2-(x1_next+1)) < abs(X2-x1_prev):
			
			x1_prev = x1_next
			x1_next += 1
	if i == 'W':
		
		if abs(X2-(x1_next-1)) < abs(X2-x1_prev):
			
			x1_prev = x1_next
			x1_next -= 1
	if i == 'N':
		
		if abs(Y2-(y1_next+1)) < abs(Y2-y1_prev):
			
			y1_prev = y1_next
			y1_next += 1
	if i == 'S':
		
		if abs(Y2-(y1_next-1)) < abs(Y2-y1_prev):
			
			y1_prev = y1_next
			y1_next -= 1
	steps += 1
#print([x1_next,y1_next])
if [x1_next,y1_next] == [X2,Y2]:
	print(steps)
else:
	print(-1)