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).
ls_input = list(map(int,input().split()))
t,sx,sy,ex,ey = ls_input
str_dir = input()

time = 0

def dist_formula(x1,y1):
    dist = (((ex-x1)**2)+((ey-y1)**2))**0.5
    return dist

def north(x,y):
    return x,y+1
def south(x,y):
    return x,y-1
def east(x,y):
    return x+1,y
def west(x,y):
    return x-1,y


for dir in str_dir:
    time+=1

    if dir == 'N':

        x,y = north(sx,sy)

        if dist_formula(x,y) < dist_formula(sx,sy):
            sx = x
            sy = y

    elif dir == 'S':
        x, y = south(sx, sy)

        if dist_formula(x, y) < dist_formula(sx, sy):
            sx = x
            sy = y


    elif dir == 'E':
        x, y = east(sx, sy)

        if dist_formula(x, y) < dist_formula(sx, sy):
            sx = x
            sy = y


    else:
        x, y = west(sx, sy)

        if dist_formula(x, y) < dist_formula(sx, sy):
            sx = x
            sy = y

    if sx == ex and sy == ey:
        print(time)
        break

else:
    print(-1)




