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).
# https://codeforces.com/problemset/problem/298/B

"""
Want to go from (s_x, s_y) to (e_x, e_y)
Every second the direction of the wind changes:
    * They can choose to go in the direction of the wind
    * They can choose to anchor

Given t seconds:
    * If impossible print -1
    * Otherwise give the earliest time they can get to their destination

So only use directions of shortest L1 norm path
Guaranteed that the starting and ending location will be different
"""

t, s_x, s_y, e_x, e_y = map(int, input().split())
wind = input().strip()

up, right = e_y - s_y, e_x - s_x

# If up is +ve only want to move N, if -ve only want to move S
# If right is +ve only want to move E, if -ve only want to move W

y_value = {direction: 0 for direction in 'NSEW'}
x_value = {direction: 0 for direction in 'NSEW'}


if up > 0:  # We want to move up so seeing a N means we have 1 less to go up
    y_value['N'] = -1
elif up < 0:  # We want to move down so seeing a S means we have less to go down
    y_value['S'] = 1

if right > 0:
    x_value['E'] = -1
elif right < 0:
    x_value['W'] = 1


for i in range(t):
    up += y_value[wind[i]]
    right += x_value[wind[i]]

    if up == 0 and right == 0:
        break


if up == 0 and right == 0:
    print(i+1)
else:
    print(-1)


