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).
n, s_x, s_y, e_x, e_y = [int(i) for i in input().split()]
motion = input()
n = len(motion)

helper = {}
def sail(i, x, y, curr_time):
    if (x, y) == (e_x, e_y): return curr_time
    if i == n: return float("inf")
    a, b = x, y
    if motion[i] == "S": b -= 1
    elif motion[i] == "N": b += 1
    elif motion[i] == "E": a += 1
    else: a -= 1
    if (x, y) not in helper:
        helper[(x, y)] = sail(i + 1, x, y, curr_time + 1)
    if (a, b) not in helper:
        helper[(a, b)] = sail(i + 1, a, b, curr_time + 1)
    return min(helper[(x, y)], helper[(a, b)])

res = sail(0, s_x, s_y, 0)
print(res if res != float("inf") else -1)