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 get_earliest(t: int, directions: str, xdiff: int, ydiff: int):
    EAST = "E"
    WEST = "W"
    SOUTH = "S"
    NORTH = "N"

    # O(t)
    for i in range(t):
        d = directions[i]

        if d == EAST and xdiff > 0:
            xdiff -= 1
        elif d == WEST and xdiff < 0:
            xdiff += 1

        if d == NORTH and ydiff > 0:
            ydiff -= 1
        elif d == SOUTH and ydiff < 0:
            ydiff += 1

        if xdiff == 0 and ydiff == 0:
            return i + 1

    return -1


if __name__ == "__main__":
    t, sx, sy, ex, ey = list(map(int, input().split()))
    dirs = input()

    xdiff = ex - sx
    ydiff = ey - sy

    answer = get_earliest(t, dirs, xdiff, ydiff)
    print(answer)

	  	  	  	 	 			  			   			 		