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).
# cook your dish here
from collections import Counter
t,sx,sy,ex,ey = map(int,input().split())
s=input()
d = Counter(s)

if ex>sx and ey>sy:
    if d['E']>=ex-sx and d['N']>=ey-sy:
        east,north=0,0
        i=0
        while north<ey-sy or east<ex-sx:
            if s[i]=='E':
                east+=1
            
            if s[i]=='N':
                north+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
        
elif ex>sx and ey<sy:
    if d['E']>=ex-sx and d['S']>=sy-ey:
        east,south=0,0
        i=0
        while south<sy-ey or east<ex-sx:
            if s[i]=='E':
                east+=1
            
            if s[i]=='S':
                south+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
elif ex<sx and ey>sy:
    if d['W']>=sx-ex and d['N']>=ey-sy:
        west,north=0,0
        i=0
        while west<sx-ex or north<ey-sy:
            if s[i]=='W':
                west+=1
            
            if s[i]=='N':
                north+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
elif ex<sx and ey<sy:
    if d['W']>=sx-ex and d['S']>=sy-ey:
        west,south=0,0
        i=0
        while south<sy-ey or west<sx-ex:
            if s[i]=='W':
                west+=1
            
            if s[i]=='S':
                south+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
elif ex>sx and ey==sy:
    if d['E']>=ex-sx:
        east=0
        i=0
        while east<ex-sx:
            if s[i]=='E':
                east+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
elif ex<sx and ey==sy:
    if d['W']>=sx-ex:
        west=0
        i=0
        while west<sx-ex:
            if s[i]=='W':
                west+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
elif ex==sx and ey>sy:
    if d['N']>=ey-sy:
        north=0
        i=0
        while north<ey-sy:
            if s[i]=='N':
                north+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)
        
elif ex==sx and ey<sy:
    if d['S']>=sy-ey:
        south=0
        i=0
        while south<sy-ey:
            if s[i]=='S':
                south+=1
                
            i+=1
            
        print(i)
        
    else:
        print(-1)