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).
t,x1,y1,x2,y2  = map(int,input().split())
s = str(input())
a = x2 - x1
b = y2 - y1
from itertools import islice

def nth_index(iterable, value, n):
    matches = (idx for idx, val in enumerate(iterable) if val == value)
    return next(islice(matches, n-1, n), None)
if a > 0 and b > 0:
    f = nth_index(s,'E',a)
    l = nth_index(s,'N',b)
    if s.count('E') < abs(a) or s.count('N') < abs(b):
        final = -1
    else:
        final = max(f,l)+1
elif a > 0 and b < 0 :
    f = nth_index(s,'E',abs(a))
    l = nth_index(s,'S',abs(b))
    if s.count('E') < abs(a) or s.count('S') < abs(b):
        final = -1
    else:
        final = max(f,l)+1
elif a < 0 and b > 0:
    f = nth_index(s,'W',abs(a))
    l = nth_index(s,'N',abs(b))
    if s.count('W') < abs(a) or s.count('N') < abs(b):
        final = -1
    else:
        final = max(f,l)+1
elif a < 0 and b < 0:
    f = nth_index(s,'W',abs(a))
    l = nth_index(s,'S',abs(b))
    if s.count('W') < abs(a) or s.count('S') < abs(b):
        final = -1
    else:
        final = max(f,l)+1
elif a > 0 and b == 0:
    f = nth_index(s,'E',abs(a))
    if s.count('E') < abs (a):
        final = -1
    else:
        final = f+1

elif a < 0 and b == 0:
    f = nth_index(s,'W',abs(a))
    if s.count('W') < abs (a):
        final = -1
    else:
        final = f+1
elif a == 0 and b > 0:
    f = nth_index(s,'N',abs(b))
    if s.count('N') < abs (b):
        final = -1
    else:
        final = f+1
elif a == 0 and b < 0:
    f = nth_index(s,'S',abs(b))
    if s.count('S') < abs (b):
        final = -1
    else:
        final = f+1



print(final)