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).
line=input()
t=int(line.split()[0])
sx=int(line.split()[1])
sy=int(line.split()[2])
ex=int(line.split()[3])
ey=int(line.split()[4])
direction=list(input())
x=ex-sx
y=ey-sy
if x>0:
    m=0
    for i,j in enumerate(direction):
        if j=='E':
            m+=1
            if m==x:
                tx=i
                break
elif x<0:
    m=0
    for i,j in enumerate(direction):
        if j=='W':
            m-=1
            if m==x:
                tx=i
                break
if y>0:
    n=0
    for i,j in enumerate(direction):
        if j=='N':
            n+=1
            if n==y:
                ty=i
                break
elif y<0:
    n=0
    for i,j in enumerate(direction):
        if j=='S':
            n-=1
            if n==y:
                ty=i
                break
try:
    tf=max(tx,ty)
except:
    tf=-1
print(tf)