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).
from collections import defaultdict
# If we are not alowed to skip any moves, the solution is trivial
# if I calculate answer to trivial solution while recording the number of SNWE directions we had
# we can see if the target has ever been in range
# if this solution is viable it will only give us if we can reach there or not,  
# but if it also gives us what directions we need to skip, it is trivial to calculate the time
# I overly complicated it, being able to skip moves is not a complication but rather a simplification
# we only need to count how many SNEW we need to get to the location
_, sx, sy, ex, ey = map(int, input().split())
dirs = input()
d = defaultdict(int) 
ans = -1

for t, e in enumerate(dirs):
    if e == 'S' and sy > ey:
        sy -= 1
    if e == 'N' and sy < ey:
        sy += 1
    if e == 'W' and sx > ex: 
        sx -= 1
    if e == 'E' and sx < ex: 
        sx += 1
    if sx == ex and sy == ey: 
        ans = t + 1
        break
print(ans)


