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 solve():
    [num, x1, y1, x2, y2] = list(map(int, input().split()))
    direction = input()

    x = abs(abs(x2) - abs(x1))
    y = abs(abs(y2) - abs(y1))

    x *= 1 if x1 < x2 else -1

    y *= 1 if y1 < y2 else -1

    # print('X -> ', x)
    # print('Y -> ', y)

    countE, countW, countN, countS = 0, 0, 0, 0

    count = 0
    foundX = None
    foundY = None

    for char in direction:
        count += 1

        if x > 0 and char == 'E':
            countE += 1
        
        if x < 0 and char == 'W':
            countW += -1

        if y > 0 and char == 'N':
            countN += 1

        if y < 0 and char == 'S':
            countS += -1


        if x > 0 and countE == x:
            foundX = True

        if x < 0 and countW == x:
            foundX = True

        if y > 0 and countN == x:
            foundY = True

        if y < 0 and countS == x:
            foundY = True

        
        if foundX and foundY:
            print(count)
            return



    # print(x1, y1)
    print(-1)
    return -1

    return ''


solve()
