#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
bool isPrime(long long n) {
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
long long factorial(long long n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    y = y >> 1;
    x = (x * x) % mod;
  }
  return res % mod;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
long long max(long long a, long long b) {
  long long ans = a > b ? a : b;
  return ans;
}
long long min(long long a, long long b) {
  long long ans = a < b ? a : b;
  return ans;
}
signed main() {
  long long t = 1;
  while (t--) {
    long long n, x1, y1, x2, y2;
    cin >> n >> x1 >> y1 >> x2 >> y2;
    string s;
    cin >> s;
    for (long long i = 0; i < n; i++) {
      if (s[i] == 'E' && x1 < x2)
        x1++;
      else if (s[i] == 'W' && x1 > x2)
        x1--;
      else if (s[i] == 'N' && y1 < y2)
        y1++;
      else if (s[i] == 'S' && y1 > y2)
        y1--;
      if (x1 == x2 && y1 == y2) {
        cout << i + 1;
        return 0;
      }
    }
    cout << "-1";
  }
  return 0;
}
