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).
from collections import defaultdict
t,i,j,x,y = map(int,input().split())
s = input()
dic=defaultdict(int)

for c in s:
    if c in dic:
        dic[c]+=1
    else:
        dic[c]=1
#print(i,j,x,y)
dir_x = int(x)-int(i) # +ve=> N -ve => S
dir_y = int(y)-int(j) # +ve=> E -ve=> W
# print(dir_x,dir_y)
req_W,req_E,req_N,req_S = 0,0,0,0
if(dir_x>0):
    req_N = dir_x
elif(dir_x<0):
    req_S = dir_x
if(dir_y>0):
    req_E = dir_y
elif(dir_y<0):
    req_W = dir_y
if(dic['W']<req_W or dic['E']<req_E or dic['S']<req_S or dic['N']<req_N):
    print(-1)
else:
    ans=0
    for i in s:
        if(req_W==0 and req_S==0 and req_N==0 and req_E==0):
            break
        else:
            ans += 1
        if(i=='W' and req_W):
            req_W-=1
        if(i=='E' and req_E):
            req_E-=1
        if(i=='S' and req_S):
            req_S-=1
        if(i=='N' and req_N):
            req_N-=1

    print(ans)

