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).
import sys
input = lambda: sys.stdin.readline().strip("\r\n")

d = {"N": (0, 1),
     "S": (0, -1),
     "E": (1, 0),
     "W": (-1, 0)
     }

t, sx, sy, ex, ey = map(int, input().split())
directions = list(input())
x_diff = ex - sx
y_diff = ey - sy
req_x = "E"
req_y = "N"
if x_diff < 0:
    req_x = "W"
if y_diff < 0:
    req_y = "S"
x_diff = abs(x_diff)
y_diff = abs(y_diff)
x_cnt = 0
y_cnt = 0
if x_diff != 0:
    for i in range(t):
        if req_x == directions[i]:
            x_diff -= 1
            x_cnt = i+1
if y_diff != 0:
    for i in range(t):
        if req_y == directions[i]:
            y_diff -= 1
            y_cnt = i+1
if x_diff > 0 or y_diff > 0:
    print(-1)
else:
    print(max(x_cnt, y_cnt))
