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 find_nth(haystack, needle, n):
    start = haystack.find(needle)
    while start >= 0 and n > 1:
        start = haystack.find(needle, start+len(needle))
        n -= 1
    return start

a = [int(e) for e in input().split()]
t = a[0]
start = [a[1], a[2]]
end = [a[3], a[4]]

b = str(input())   # SESNW
wind = {'S': 0, 'E': 0, 'N': 0, 'W': 0}
for e in b:
    wind[e] += 1
# wind = {'S': 2, 'E': 1, 'N': 1, 'W': 1}

need_wind = dict()
if end[0] - start[0] > 0:
    need_wind['E'] = (end[0] - start[0])
if end[0] - start[0] < 0:
    need_wind['W'] = (start[0] - end[0])
if end[1] - start[1] > 0:
    need_wind['N'] = (end[1] - start[1])
if end[1] - start[1] < 0:
    need_wind['S'] = (start[1] - end[1])   
# need_wind = {'E': 1, 'N': 1}

for e in need_wind:
    if wind[e] < need_wind[e]:
        print(-1)
        exit()

indx_wind = []
for e in need_wind:
    x = find_nth(b, e, need_wind[e])
    indx_wind.append(x)
print(max(indx_wind) + 1)