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 collections
from math import log2, log10, ceil

def pow2(n):
    t = 0
    while not(n&1):
        n = n//2
        t += 1
    return t

def findDir(sx, sy, ex, ey):
    if ex>sx and ey>sy:
        return "EN"
    elif ex>sx and ey<sy:
        return "ES"
    elif ex<sx and ey>sy:
        return "WN"
    elif ex<sx and ey<sy:
        return "WS"
    elif ex==sx and ey!=sy:
        if ey<sy:
            return "S"
        elif ey>sy:
            return "N"
    elif ey==sy:
        if ex>sx:
            return "E"
        elif ex<sx:
            return "W"

def move(ch, x, y):
    if ch=='N':
        return x, y+1
    elif ch=='S':
        return x, y-1
    elif ch=='E':
        return x+1, y
    else:
        return x-1, y

def solve():
    t,sx,sy,ex,ey = map(int, input().split())
    nsew = input()

    s = findDir(sx, sy, ex, ey)

    found = 0
    for i in range(t):
        if(sx==ex and sy==ey):
            found = 1
            break
        else:
            if nsew[i] in s:
                sx, sy = move(nsew[i], sx, sy)
    
    if found:
        print(i)
    else:
        print(-1)
def main():
    t = 1
    while t:
        t -= 1
        solve()

if __name__ == '__main__':
    main()
