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=[int(a) for a in input().split()]
s=input()
x=[]
x.append(a[3]-a[1])
x.append(a[4]-a[2])
l=[]#direction
m=[]#count
if x[0]>0:
    l.append("E")
elif x[0]<0:
    l.append("W")
    x[0]=-x[0]
if x[1]>0:
    l.append("N")
elif x[1]<0:
    l.append("S")
    x[1]=-x[1]
for i in range(len(l)):
    m.append(s.count(l[i]))
#print(x,l,m)
for j in range(len(l)):
    for k in range(len(s)):
        if s[k]==l[j]:
            if m[j]<x[j]:
                print(-1)
                exit()
            if m[j]==x[j]:
                if j==1:
                    print(k+1)
                    exit()
                break
            m[j]=m[j]-1
print(-1)



