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).
import math
mod = 1000000007
from sys import stdin, stdout
#from collections import defaultdict, Counter, deque
#from bisect import bisect_left, bisect_right
# import sympy
# from itertools import permutations
# import numpy as np

#           n = int(stdin.readline())
#           stdout.write(str())
#           s = stdin.readline().strip('\n')
#           n,k=map(int, stdin.readline().split())
#           li = list(map(int, stdin.readline().split()))
for _ in range(1):
    t,a,b,x,y=map(int, stdin.readline().split())
    if a<=x:
        p="E"
        p_count=x-a
    else:
        p="W"
        p_count=a-x
    if b<=y:
        q="N"
        q_count=y-b
    else:
        q="S"
        q_count=b-y
    if q_count==0 and p_count==0:
        print(0)
        continue
    ans=-1
    # print(p_count,q_count)
    # print(p,q)
    s = stdin.readline().strip('\n')
    for i in range(0,t):
        # x=input()
        if p==s[i] and p_count!=0:
            p_count-=1
        if q==s[i] and q_count!=0:
            q_count-=1
        # print(p_count,q_count)
        if p_count==0 and q_count==0 and ans==-1:
            ans=i
        # print(ans)
    if ans==-1:
        print(ans)
        continue
    print(ans+1)