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).
s = [None, None]
e = [None, None]
t, s[0], s[1], e[0], e[1] = (map(int, input().split()))
g_dirs = input()
a_dirs1 = ''
a_dirs2 = ''
xd = e[0] - s[0]
yd = e[1] - s[1]
if xd < 0:
    a_dirs1 += ('W'*(-xd))
else:
    a_dirs1 += ('E'*xd)
if yd < 0:
    a_dirs1 += ('S'*(-yd))
    a_dirs2 += ('S'*(-yd))
else:
    a_dirs1 += ('N'*yd)
    a_dirs2 += ('N'*yd)
if xd < 0:
    a_dirs2 += ('W'*(-xd))
else:
    a_dirs2 += ('E'*xd)

i = 0
j1 = 0
j2 = 0
l_g = len(g_dirs)
l_a1 = len(a_dirs1)
l_a2 = len(a_dirs1)
while i < l_g and j1 < l_a1 and j2 < l_a2:
    if g_dirs[i] == a_dirs1[j1]:
        j1 += 1
    if g_dirs[i] == a_dirs2[j2]:
        j2 += 1
    i += 1

print(i) if j1 == l_a1 or j2 == l_a2 else print(-1)
