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).
from itertools import permutations
from itertools import combinations
t,sx,sy,ex,ey=map(int,input().split())
s=input()
s2=''
s3=''
s1=''
c=0
d=0
fx,fy=(ex-sx),(ey-sy)
if fx>=0 and fy>=0:
    s1+='E'*fx+'N'*fy
if fx>=0 and fy<0:
    s1+='E'*fx+'S'+abs(fy)
if fx<0 and fy>=0:
    s1+='W'*abs(fx)+'N'*fy
if fx<0 and fy<0:
    s1+='W'*abs(fx)+'S'*abs(fy)
l=permutations(s1)
l1=[]
for perm in list(l):
    l1.append(''.join(perm))
for i in range(0,len(s),2):
    s2+=s[i]
for i in range(1,len(s),2):
    s3+=s[i]
res1 = [s2[x:y] for x, y in combinations(range(len(s2) + 1), r = 2)]
res2 = [s3[x:y] for x, y in combinations(range(len(s3) + 1), r = 2)]
for i in range(len(l1)):
    for j in range(len(s2)):
        if l1[i]==res1[j]:
            c+=1
            break
    for j in range(len(s3)):
        if l1[i]==res2[j]:
            d+=1
            break
if c==1 or d==1:
    print('YES')