#include <bits/stdc++.h>
using namespace std;
char dirs[100001];
int todo[4];
int main() {
  int n, fx, fy, tx, ty;
  string wind;
  cin >> n >> fx >> fy >> tx >> ty >> wind;
  memcpy(dirs, wind.c_str(), n);
  memset(todo, 0, sizeof(todo));
  if (fx < tx) todo[0] = tx - fx;
  if (fy < ty) todo[3] = ty - fy;
  if (fx > tx) todo[2] = fx - tx;
  if (fy > ty) todo[1] = fy - ty;
  for (int i = 0; i < n; i++) {
    switch (dirs[i]) {
      case 'E':
        if (todo[0]) todo[0]--;
        break;
      case 'S':
        if (todo[1]) todo[1]--;
        break;
      case 'W':
        if (todo[2]) todo[2]--;
        break;
      case 'N':
        if (todo[3]) todo[3]--;
        break;
    }
    if (todo[0] == 0 && todo[1] == 0 && todo[2] == 0 && todo[3] == 0) {
      cout << i + 1 << endl;
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}
