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).
size, x1, y1, x2, y2 = map(int, input().strip().split())
arr = list(input())
d1 = abs(x1 - x2)
d2 = abs(y1 - y2)
xd = []
yd = []
if x1 < x2:
    xd = ['E'] * d1
elif x2 < x1:
    xd = ['W'] * d1
if y1 < y2:
    yd = ['N'] * d2
elif y2 < y1:
    yd = ['S'] * d2
xi, yi = 0, 0
idx = 0
while (xi < len(xd) or yi < len(yd)) and idx < len(arr):
    if xi < len(xd):
        if arr[idx] == xd[xi]:
            xi += 1
    elif yi < len(yd):
        if arr[idx] == yd[yi]:
            yi += 1
    idx += 1
    if xi == len(xd) and yi == len(yd):
        break
print(idx if xi == len(xd) and yi == len(yd) else -1)
