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).
def sail(s, ss, se, es, ee):
    x = 0
    y = 0
    if ss>es:
        x = ['W', ss-es]
    else: 
        x = ['E', es-ss]

    if se>ee:
        y = ['S', se-ee]
    else:
        y = ['N', ee-se]

    if x==0:
        i = 0
        while y[1]!=0 or i<len(s):
            if s[i] == y[0]:
                y[1]-=1
            
            if y[1]==0:
                return i+1
            i+=1
        return -1
    elif y==0:
        i = 0
        while x[1]!=0 or i<len(s):
            if s[i] == x[0]:
                x[1]-=1

            if x[1] == 0:
                return i+1
            i+=1
        return -1
    else:
        i = 0
        while (x[1]!=0 and y[1]!=0) or i<len(s):
            if(s[i] == x[0]):
                x[1]-=1
            elif(s[i] == y[0]):
                y[1] -= 1

            if x[1] == 0 and y[1]==0:
                return i+1
            i+=1
        return -1

    

    

    

t, ss, se, es, ee = map(int, input().split())
s = input()
print(sail(s, ss, se, es, ee))