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 collections import defaultdict


def mycount(directions):
    d = defaultdict(int)
    for i in directions:
        d[i] += 1
    return d

def main():
    t, sx, sy, ex, ey = map(int, input().split())
    directions = input()
    d = mycount(directions)

    length_to_east = ex - sx
    length_to_north = ey - sy
    north = None
    if length_to_north > 0:
        if d['N'] < length_to_north:
            return -1
        north = "N"
    elif length_to_north < 0:
        if d['S'] < abs(length_to_north):
            return -1
        north = "S"
    east = None    
    if length_to_east > 0:
        if d["E"] < length_to_east:
            return -1
        east = "E"
    elif length_to_east < 0:
        if d["W"] < abs(length_to_east):
            return -1
        east = "W"
    
    
    travel = 0
    for i in directions:
        if length_to_east == 0 and length_to_north == 0: break
        travel += 1
        if i == north:
            length_to_north -= 1
        elif i == east:
            length_to_east -= 1
    
    return travel
    
print(main())