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().split())
direc=input()

l1=ex-sx
l2=ey-sy
flag=0
if l1>=0 and l2>=0:
	count_east=0
	count_north=0
	
	for i in range(len(direc)):
		if direc[i]=='E':
			count_east+=1
		if direc[i]=='N':
			count_north+=1
		if count_east>=l1 and count_north>=l2:
			print(i+1)
			flag=1
			break
	if flag==0:
		print(-1)
	
elif l1>=0 and l2<0:
	count_east=0
	count_south=0
	for i in range(len(direc)):
		if direc[i]=='E':
			count_east+=1
		if direc[i]=='N':
			count_south+=1
			
		if count_east>=l1 and count_south>=abs(l2):
			print(i+1)
			flag=1
			break
	if flag==0:
		print(-1)

elif l1<0 and l2>=0:
	count_west=0
	count_north=0
	for i in range(len(direc)):
		if direc[i]=='W':
			count_west+=1
		if direc[i]=='N':
			count_north+=1
		if count_west>=abs(l1) and count_north>=l2:
			print(i+1)
			flag=1
			break
	if flag==0:
		print(-1)
else:
	count_west=0
	count_south=0
	for i in range(len(direc)):
		if direc[i]=='W':
			count_west+=1
		if direc[i]=='S':
			count_south+=1
		if count_west>=abs(l1) and count_south>=abs(l2):
			print(i+1)
			flag=1
			break
	if flag==0:
		print(-1)

