#include <bits/stdc++.h>
using namespace std;
const int N = 1E5 + 10;
long long x[N], y[N], x_, x2, y_, y2, n;
string s;
bool ok(long long d) {
  long long tx = x_ + d / n * x[n] + x[d % n];
  long long ty = y_ + d / n * y[n] + y[d % n];
  return abs(tx - x2) + abs(ty - y2) > d;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> x_ >> y_ >> x2 >> y2;
  cin >> n;
  cin >> s;
  for (int i = 1; i <= n; ++i) {
    char c = s[i - 1];
    x[i] = x[i - 1], y[i] = y[i - 1];
    if (c == 'L') {
      x[i]--;
    } else if (c == 'R') {
      x[i]++;
    } else if (c == 'U') {
      y[i]++;
    } else {
      y[i]--;
    }
  }
  long long l = 0, r = LLONG_MAX / 2, ans = -1;
  while (l <= r) {
    long long mid = (l + r) >> 1;
    if (ok(mid)) {
      l = mid + 1;
    } else {
      r = mid - 1;
      ans = mid;
    }
  }
  cout << ans << endl;
  return 0;
}
