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).
# for _ in range(0, int(input())): 
# n = int(input())





import math
t, sx, sy, ex, ey  = map(int, input().strip().split())
l = list(input().strip())

f=0
counter = 0
current_step = [sx, sy]
destination=[ex,ey]
current_distance=math.sqrt((current_step[0]-destination[0])**2+(current_step[1]-destination[1])**2)
# print(current_distance)
while t > 0:
	d = l[counter]
	# print(d) 
	# possible_step = []
	if d=='N': possible_step = [current_step[0], current_step[1]+1]
	if d=='S': possible_step = [current_step[0], current_step[1]-1]
	if d=='E': possible_step = [current_step[0]+1, current_step[1]]
	if d=='W': possible_step = [current_step[0]-1, current_step[1]] 

	possible_distance = math.sqrt((possible_step[0]-destination[0])**2 + (possible_step[1]-destination[1])**2)
	if possible_distance < current_distance:
		current_step = possible_step
		current_distance = possible_distance 
	if current_distance == 0:
		print(counter+1)
		f = 8
		break
	t-=1
	counter+=1
if f ==0: print(-1)