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).
INF = float('inf')
def calc(t, sx, sy, ex, ey, wind):
    if (sx, sy) == (ex,ey):
        return 0
    for i in range(len(wind)):
        wind_dir = wind[i]
        if wind_dir == 'E':
            nsx, nsy = sx+1, sy
        elif wind_dir == 'S':
            nsx, nsy = sx, sy-1
        elif wind_dir == 'W':
            nsx, nsy = sx-1, sy
        elif wind_dir == 'N':
            nsx, nsy = sx, sy+1

        if abs(ex - nsx) + abs(ey - nsy) > abs(ex-sx) + abs(ey-sy):
            continue
        sx, sy = nsx, nsy
        if (sx, sy) == (ex, ey):
            return i + 1
    return -1

    # get inputs
#n = int(input())
#a = list(map(int, input().split()))
t, sx, sy, ex, ey = map(int, input().split())
wind = input()
res = calc(t, sx, sy, ex, ey, wind)
print(res)
