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 Counter
t,sx,sy,ex,ey=map(int,input().split())
directions=input()
dir_freq=dict(Counter(directions))
req_dir={'N':0,'E':0,'W':0,'S':0}

for i in req_dir:
    if i not in dir_freq:
        dir_freq[i]=0

dx=ex-sx
dy=ey-sy
if dx>0:
    req_dir['E']+=dx
if dx<0:
    req_dir['W']+=abs(dx)
if dy>0:
    req_dir['N']+=dy
if dy<0:
    req_dir['S']+=abs(dy)
possible=True
for i in dir_freq:
    if dir_freq[i]<req_dir[i]:
        possible=False
        break
if not possible:
    print(-1)
else:
    time_taken=1
    i=0
    while(req_dir['N'] or req_dir['E'] or req_dir['W'] or req_dir['S']):
        if i==len(directions)-1:
            break
        if req_dir[directions[i]]>0:
            req_dir[directions[i]]-=1
        i+=1
    print(i)