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).
x=list(map(int, input().split()))
a=input()
freq = {}
for item in a:
    if (item in freq):
        freq[item] += 1
    else:
        freq[item] = 1
s1=x[1]
s2=x[2]
e1=x[3]
e2=x[4]
c={}
if s1>e1:
    c['W']=s1-e1
elif s1<e1:
    c['E']=e1-s1
if s2>e2:
    c['S']=s2-e2
elif s2<e2:
    c['N']=e2-s2
f=0
for i in c:
    if i not in freq:
        f=1
        break
    else:
        if c[i]>freq[i]:
            f=1
            break
if f==1:
    print(-1)
else:
    r=[]
    for i in c:
        p=[pos for pos, char in enumerate(a) if char == i]
        q=p[:(c[i])]
        r.append(q[-1])
    res=max(r)+1
    print(res)