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).
"""
    author - Sayan Bose
    date - 29.01.2020
    Brooklyn 99 is love!
"""

t, ix, iy, fx, fy = map(int, input().split())
s = input()

d = {'x': fx - ix, 'y':fy - iy}

f = 1
if d['x'] < 0:
	if s.count('W') < abs(d['x']):
		f = 0
else:
	if s.count('E') < abs(d['x']):
		f = 0
if d['y'] < 0:
	if s.count('S') < abs(d['y']):
		f = 0
else:
	if s.count('N') < abs(d['y']):
		f = 0

if not f:
	print(-1)
	exit()
c = 0
for i in range(t):
	if s[i] == 'N':
		if d['y'] > 0:
			c = max(c, i+1)
	elif s[i] == 'S':
		if d['y'] < 0:
			c = max(c, i+1)
	elif s[i] == 'E':
		if d['x'] > 0:
			c = max(c, i+1)
	else:
		if d['x'] < 0:
			c = max(c, i+1)

print(c)