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).
a=list(map(int,input().split()))
t,bx,by,dx,dy=a[0],a[1],a[2],a[3],a[4]
difx=bx-dx
dify=by-dy
s=input()
ix,iy=-1,-1
if(difx<0):
  c=1
  for i in s:
    if(i=='E'):
      difx=difx+1
      if(difx==0):
        ix=c
    c=c+1
elif(difx>0):
  c=1
  for i in s:
    if(i=='W'):
      difx=difx-1
      if(difx==0):
        ix=c
    c=c+1
else:
  ix=0

if(dify<0):
  c=1
  for i in s:
    if(i=='N'):
      dify=dify+1
      if(dify==0):
        iy=c
    c=c+1
elif(dify>0):
  c=1
  for i in s:
    if(i=='S'):
      dify=dify-1
      if(dify==0):
        iy=c
    c=c+1
else:
  iy=0

if(ix==-1 or iy==-1):
  print(-1)
else:
  print(max(ix,iy))



