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 math import sqrt

def main():
    t, sx, sy, ex, ey = list(map(int, input().split(' ')))
    elems = input()

    directions = {
        'N': lambda x, y: (x, y + 1),
        'S': lambda x, y: (x, y - 1),
        'E': lambda x, y: (x + 1, y),
        'W': lambda x, y: (x - 1, y)
    }
    dist = lambda x, y: sqrt((ex - x)**2 + (ey - y)**2)

    d = dist(sx, sy)
    count = 0
    for w in elems:
        cx, cy = directions[w](sx, sy)
        new_d = dist(cx, cy)
        if new_d < d:
            sx, sy = cx, cy
            d = new_d
        count += 1
        if sx == ex and sy == ey:
            break
    if sx == ex and sy == ey:
        print(count)
    else:
        print(-1)


if __name__ == "__main__":
    main()
