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()

int_arr = lambda: list(map(int,input().split()))
str_arr = lambda: list(map(str,input().split()))
get_str = lambda: map(str,input().split())
get_int = lambda: map(int,input().split())
get_flo = lambda: map(float,input().split())

mod = 1000000007

def solve(n,a,b,x,y,s):
    xx,yy = x-a,y-b
    
    if xx >= 0  and yy >= 0:
        for i in range(n):
            if s[i] == "E"  and xx > 0:
                xx -= 1
            if s[i] == "N" and yy > 0:
                yy -= 1
            if xx == 0 and yy == 0:
                print(i+1)
                return
        else:
            print("-1")
            return

    elif xx < 0  and yy < 0:
        for i in range(n):
            if s[i] == "W"  and xx < 0:
                xx += 1
            if s[i] == "S" and yy < 0:
                yy += 1
            if xx == 0 and yy == 0:
                print(i+1)
                return
        else:
            print("-1")
            return


    elif xx < 0  and yy >= 0:
        for i in range(n):
            if s[i] == "W"  and xx < 0:
                xx += 1
            if s[i] == "N" and yy > 0:
                yy -= 1
            if xx == 0 and yy == 0:
                print(i+1)
                return
        else:
            print("-1")
            return


    elif xx >= 0  and yy < 0:
        for i in range(n):
            if s[i] == "E"  and xx > 0:
                xx -= 1
            if s[i] == "S" and yy < 0:
                yy += 1
            if xx == 0 and yy == 0:
                print(i+1)
                return
        else:
            print("-1")
            return

    else:
        print("-1")










# for _ in range(int(input())):
n,a,b,x,y = get_int()
s = str(input())[:-1]
solve(n,a,b,x,y,s)
