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).
arr = list(map(int,input().split()))
directions = input()

t = arr[0]
sx = arr[1]
sy = arr[2]
ex = arr[3]
ey = arr[4]


ansX = sx - ex
ansY = sy - ey

hashVal = {}
if ansX>0:
    hashVal["E"] = ansX

elif ansX<0:
    hashVal["W"] = abs(ansX)


if ansY>0:
    hashVal["N"] = ansY

elif ansY<0:
    hashVal["S"] = abs(ansY)


pos = -1
twoDir = []


for key in hashVal:
    twoDir.append(key)
    
for i,direction in enumerate(list(directions)):
    if direction in hashVal:
        if hashVal[direction]>0:
            hashVal[direction]-=1

    if hashVal[twoDir[0]]==0 and hashVal[twoDir[1]]==0:
        pos = i
        break


print(pos)



'''
count = 0
flag = False
for direction in directions:
    if direction =="E":
        sx,sy = sx+1,sy

    elif direction =="S":
        sx,sy = sx,sy-1

    elif direction =="W":
        sx,sy = sx-1,sy

    elif direction == "N":
        sx,sy = sx,sy+1

    count+=1
    if sx==ex and sy == ey:
        flag = True
        break

if flag:
    print(count)
else:
    print(-1)

'''

    
    

