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).
def solver(t, sx, sy, ex, ey, _list_):
    dx, dy = ex - sx, ey - sy
    s, n, e, w = 0, 0, 0, 0
    cs, cn, ce, cw = 0, 0, 0, 0
    flag_n_s, flag_w_e = '', ''


    if dx < 0:
        return -1
        s = (-1)*dx
        flag_n_s = 'S'
    else:
        n = dx
        flag_n_s = 'N'

    if dy < 0:
        w = (-1)*dy
        flag_w_e = 'W'
    else:
        e = dy
        flag_w_e = 'E'


    for i, el in zip(range(t), _list_):
        if el == 'S':
            cs += 1
        elif el == 'N':
            cn += 1
        elif el == 'E':
            ce += 1
        elif el == 'W':
            cw += 1

        if flag_n_s == 'N':
            cs = 0
        else:
            cn = 0

        if flag_w_e == 'W':
            ce = 0
        else:
            cw = 0

        if cs == s and cn == n and ce == e and cw == w:
            return i+1

    return -1

t, sx, sy, ex, ey = map(int, input().split(" "))
_list_ = input()
print(solver(t, sx, sy, ex, ey, _list_))