#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3F3F3F3F;
const int MAXN = 100001;
char str[MAXN];
inline void solve(int test) {
  int t, sx, sy, ex, ey;
  scanf("%d %d %d %d %d", &t, &sx, &sy, &ex, &ey);
  scanf("%s", str);
  ;
  int X, Y;
  X = ex - sx, Y = ey - sy;
  pair<char, char> S;
  if (Y < 0)
    S.first = 'S';
  else
    S.first = 'N';
  if (X < 0)
    S.second = 'W';
  else
    S.second = 'E';
  X = abs(X);
  Y = abs(Y);
  for (int i = 0; i < t; ++i) {
    char G = str[i];
    if (S.first == G)
      Y--;
    else if (S.second == G)
      X--;
    if (X <= 0 && Y <= 0) {
      printf("%d\n", i + 1);
      return;
    }
  }
  printf("-1\n");
}
int main() {
  solve(0);
  return 0;
}
