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, sx,sy, ex, ey = map(int, input().strip().split())

strs = input()
flag = 0
e, w, s, n = [], [], [], []
diffx  = ex - sx
diffy = ey - sy
for x in range(t):
    
    if strs[x] == "E":
        e.append(x+1)
    
    elif strs[x] == "W":
        w.append(x+1)
        
    elif strs[x] == "N":
        n.append(x+1)
        
    else:
        s.append(x+1)
        
    
ans = []

if diffx >= 0 and diffy >= 0:
    if len(e) >= diffx and len(n) >= diffy:
        ans.extend(e[0:diffx])
        ans.extend(n[0:diffy])
        ans.sort
        print(ans[-1])
    else:
        print("-1")
        
elif diffx >= 0 and diffy < 0:
    if len(e) >= diffx and len(s) >= diffy:
        ans.extend(e[0:diffx])
        ans.extend(s[0:diffy])
        ans.sort
        print(ans[-1])
    else:
        print("-1")        
        
elif diffx < 0 and diffy >= 0:
    if len(e) >= diffx and len(s) >= diffy:
        ans.extend(w[0:diffx])
        ans.extend(n[0:diffy])     
        ans.sort
        print(ans[-1])
    else:
        print("-1")    

elif diffx < 0 and diffy < 0:
    if len(e) >= diffx and len(s) >= diffy:
        ans.extend(w[0:diffx])
        ans.extend(s[0:diffy])  
        ans.sort
        print(ans[-1])
    else:
        print("-1")          
        
