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 , x , y , e , d = map(int,input().split())
s = input()
if(x==e and y==d):
    print(0)
else:
    diffx = abs(x-e)
    diffy = abs(y-d)
    flag = 0
    count =0 
    for i in s:
        xpoint = x
        ypoint = y
        if(i=='S'):
            ypoint-=1
        elif(i=='N'):
            ypoint+=1
        elif(i=='W'):
            xpoint-=1
        else:
            xpoint+=1
        diffnewx = abs(xpoint-e)
        diffnewy = abs(ypoint-d)
        if(diffnewx<=diffx and diffnewy<=diffy):
            x = xpoint
            y = ypoint
            diffx = diffnewx
            diffy = diffnewy
        count+=1
        if(x==e and y==d):
            flag = 1
            break
    if(flag==1):
        print(count)
    else:
        print(-1)
