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).
l=list(map(int,input().strip().split()))
s=input()
"""
19 -172106364 -468680119 -172106365 -468680119
SSEEESSSESESWSEESSS"""
t=l[0]
x=l[1]
y=l[2]
ex=l[3]
ey=l[4]
dx=ex-x
dy=ey-y
c1=0
c2=0
flag=True
#print(dx,dy)
if dx>0:
  if abs(dx)==s.count('E'):
    ns=s[::-1]
    c1=max(s.index('E'),ns.index('E'))
  else:
    flag=False
    print(-1)
elif dx<0:
  if abs(dx)==s.count('W'):
    ns=s[::-1]
    c1=max(s.index('W'),ns.index('W'))
  else:
    flag=False
    print(-1)
if flag==True:
  if dy>0:
    if dy==s.count('N'):
      ns=s[::-1]
      c2=max(s.index('N'),ns.index('N'))
    else:
      flag=False
      print(-1)
  elif dy<0:
    if dy==s.count('S'):
      ns=s[::-1]
      c2=max(s.index('S'),ns.index('S'))
    else:
      flag=False
      print(-1)
if flag==True:
  print(max(c1,c2)+1)
