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, sx, sy, ex, ey = [int(x) for x in input().split()]
s = input()

x = ex - sx
y = ey - sy
lx = 0
ly = 0
if x > 0:
    s = s.replace('W', ' ')
elif x < 0:
    s = s.replace('E', ' ')
if y > 0:
    s = s.replace('S', ' ')
elif y < 0:
    s = s.replace('N', ' ')
for b in range(len(s)):
    if s[b] == ' ':
        continue
    elif s[b] == 'N' and y != 0:
        y -= 1
        ly = b + 1
    elif s[b] == 'S' and y != 0:
        y += 1
        ly = b + 1
    elif s[b] == 'E' and x != 0:
        x -= 1
        lx = b + 1
    elif s[b] == 'W' and x != 0:
        x += 1
        lx = b + 1
if x == 0 and y == 0:
    print(max(lx, ly))
else:
    print(-1)