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).
t, a, b, c, d = list(map(int, input().split()))
arr = list(input())
if b == d:
    if arr.count("E") >= abs(a - c):
        time = 0
        cou = 0
        for k in arr:
            if cou < abs(a - c):
                time += 1
                if k == 'E':
                    cou += 1
            else:
                print(time)
                exit()

    else:
        print(-1)
elif a == c:
    if arr.count("N") >= abs(b - d):
        time = 0
        cou = 0
        for k in arr:
            if cou < abs(b - d):
                time += 1
                if k == 'N':
                    cou += 1
            else:
                print(time)
                exit()
    else:
        print(-1)
elif c > a and d > b:
    if arr.count("N") + arr.count("E") == (c - a) + (d - b):
        time = 0
        cou = 0
        for k in arr:
            if cou < (c - a) + (d - b):
                time += 1
                if k == "N":
                    cou += 1
                elif k == "E":
                    cou += 1
            else:
                print(time)
                exit()
    else:
        print(-1)
elif a > c and d > b:
    if arr.count("E") + arr.count("S") == (a - c) + (d - b):
        time = 0
        cou = 0
        for k in arr:
            if cou < (a - c) + (d - b):
                time += 1
                if k == "S":
                    cou += 1
                elif k == "E":
                    cou += 1
            else:
                print(time)
                exit()
    else:
        print(-1)
elif a > c and b > d:
    if arr.count("W") + arr.count("S") == (a - c) + (b - d):
        time = 0
        cou = 0
        for k in arr:
            if cou < (a - c) + (d - b):
                time += 1
                if k == "S":
                    cou += 1
                elif k == "W":
                    cou += 1
            else:
                print(time)
                exit()
    else:
        print(-1)
elif c > a and b > d:
    if arr.count("W") + arr.count("N") == (a - c) + (b - d):
        time = 0
        cou = 0
        for k in arr:
            if cou < (a - c) + (d - b):
                time += 1
                if k == "N":
                    cou += 1
                elif k == "W":
                    cou += 1
            else:
                print(time)
                exit()
    else:
        print(-1)
