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, sx, sy, ex, ey = map(int,input().split())
w = list(input())
nor = 0 # up
sou = 0 # down
eas = 0 # right
wes = 0 # left

for elem in w:
    if elem == 'N':
        nor += 1
    elif elem == 'S':
        sou += 1
    elif elem == 'E':
        eas += 1
    else:
        wes += 1

r = 0
l = 0
u = 0
d = 0
f = 0
if sx < ex: # we need to go right (east)
    if eas >= ex - sx:
        r = ex - sx
    else:
        f = 1
        print(-1)
elif sx > ex: # left (west)
    if wes >= sx-ex:
        l = sx - ex
    else:
        f = 1
        print(-1)
# else: no need to go left or right

if sy < ey: # up (north)
    if nor >= ey-sy:
        u = ey-sy
    else:
        f = 1
        print(-1)
elif sy > ey: # down (south)
    if sou >= sy-ey:
        d = sy-ey
    else:
        f = 1
        print(-1)
# else: no need to go up or down

if f == 0:
    if r==l==u==d: # we already are at ex;ey
        print(0)
    else:
        s = 0
        i = 0
        while (r>0 or l>0 or u>0 or d>0) and i < t:
            if w[i] == 'N':
                u -= 1
            elif w[i] == 'S':
                d -= 1
            elif w[i] == 'W':
                l -= 1
            else:
                r -= 1
            i += 1
            s += 1
        print(s)
