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).
t,sx,sy,ex,ey=map(int,input().split())
w=input()
n=len(w)
w+=" "
ans=-1
i=0
dx=ex-sx
dy=ey-sy
if abs(dx)+abs(dy)>t:
    pass
else:
    while i<t and i<n:
        if dx==0 and dy==0:
            ans=i
            break
        if dx>=0 and dy>=0:
            if w[i]!="E" and w[i]!="N" and i<n:
                i+=1
            if dx>0 and w[i]=="E" and i<n:
                i+=1
                dx-=1
            if dy>0 and w[i]=="N"and i<n:
                i+=1
                dy-=1
        elif dx>=0 and dy<=0:
            if w[i]!="E" and w[i]!="S" and i<n:
                i+=1
            if dx>0 and w[i]=="E" and i<n:
                i+=1
                dx-=1
            if dy<0 and w[i]=="S" and i<n:
                i+=1
                dy+=1
        elif dx<=0 and dy>=0:
            if w[i]!="W" and w[i]!="N" and i<n:
                i+=1
            if dx<0 and w[i]=="W" and i<n:
                i+=1
                dx+=1
            if dy>0 and w[i]=="N" and i<n:
                i+=1
                dy-=1
        elif dx<=0 and dy<=0:
            if w[i]!="W" and w[i]!="S" and i<n:
                i+=1
            if dx<0 and w[i]=="W" and i<n:
                i+=1
                dx+=1
            if dy<0 and w[i]=="S" and i<n:
                i+=1
                dy+=1
print(ans)  