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 , sx,sy,ex,ey = map(int, input().split())
a = list(input())
m = ex - sx
n = ey - sy
d = []
f = []
# print(m,n)
if m>0:
    d+=(['E']*m)
elif m<0:
    d+=(['W']*abs(m))
if n>0:
    f+=(['N']*n)
elif n<0:
    f+=(['S']*abs(n))
i ,j = 0,0
if d==['']:
    d = []
if f==['']:
    f = []
# print(d,f)
for t in range(len(a)):
    if i<len(d) or j<len(f):
        # print(i, j)
        if i<len(d):
            if a[t]==d[i]:
                i+=1
        if j<len(f):
            if a[t]==f[j]:
                j+=1
    else:
        print(t)
        exit()
if i==len(d) and j==len(f):
    print(len(a))
else:
    print(-1)


# 99697 306523229 206812050 306526222 206810059
# NNWWWWWWNWNWWWNNNWWWNNNWWWWWWNNWNWWNNNWNWWWNNNNNWNWNWWNNNNNNNNWWNNWNNNNNWWNNWWWWWNWNNWWWWNWWNNNWNWWWNWNWWNNNNWWNWWNWWNNNNNWNNNNNNWWNNWNNWWWWWWWNNWNWWWWWWWNWNNWWWWNNWWWNNWNWNNWNWNNNWWNWWWWNNWWWNWWNNWNNNNWWWNNNWNNNWWNNWNWNWWWWNNNWWWNNNWWNWWNWNNWWNWNNWNWNNWNNWWNWNNNNWWNWNWWNNNWWNWNWWNNNNWNNNNWNNWNWNNWNWWNNNWWWWNWWWWWNWNWWNNNWWNNNWWWWNWWWWNWNWNWNWWNWWNNWNNWWNNWNWWNWNNNWNWWWWNWNNWWWWWWWNNWNWNNNWWNNWNWNWWWNWNNWNNWWWWNWWNNWWWWWNNNWWWWWNWWNWWWWWNWWWNWWWWWWNWNWWWWWNNWN...
