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())
s=list(input())
n=len(s)
c=Counter(s)
val1=1
val2=1
val1-=(ex-sx>0 and c['E']<ex-sx) or (ex-sx<0 and c['W']<sx-ex)
val2-=(ey-sy>0 and c['N']<ey-sy) or (ey-sy<0 and c['S']<sy-ey)
if val1*val2==0:
    print(-1)
else:
    indx=n*int(ex!=sx)
    indy=n*int(ey!=sy)
    for i in range(n):
        
        if ex>sx and s[i]=='E':
            ex-=1
        elif ex<sx and s[i]=='W':
            ex+=1
        if ey>sy and s[i]=='N':
            ey-=1
        elif ey<sy and s[i]=='S':
            ey+=1
        if ex==sx:
            indx=min(indx,i+1)
        if ey==sy:
            indy=min(indy,i+1)
    print(max(indx,indy))