#include <bits/stdc++.h>
using namespace std;
double pi = acos(-1);
inline long long lowbit(long long x) { return x & (-x); }
inline long long min(long long a, long long b) { return a < b ? a : b; }
inline long long max(long long a, long long b) { return a > b ? a : b; }
const long long INF = 0x3f3f3f3f, max_n = 100005, mod = 19260817;
inline long long gcd(long long a, long long b) {
  return b == 0 ? a : gcd(b, a % b);
}
inline long long pow(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
string s;
struct Node {
  long long x;
  long long y;
};
Node f[max_n];
long long n;
long long ex, ey;
bool check(long long x) {
  long long nx = f[n - 1].x * (x / n);
  long long ny = f[n - 1].y * (x / n);
  if (x % n != 0) {
    nx += f[(x % n) - 1].x;
    ny += f[(x % n) - 1].y;
  }
  long long d = abs(nx - ex) + abs(ny - ey);
  if (d <= x) {
    return 1;
  } else
    return 0;
}
signed main() {
  long long sx = 0, sy = 0;
  cin >> sx >> sy >> ex >> ey;
  ex = ex - sx;
  ey = ey - sy;
  sx = 0, sy = 0;
  cin >> n;
  cin >> s;
  long long dx = 0;
  long long dy = 0;
  for (long long i = 0; i < s.size(); i++) {
    if (s[i] == 'R') dx++;
    if (s[i] == 'D') dy--;
    if (s[i] == 'L') dx--;
    if (s[i] == 'U') dy++;
    f[i].x = dx;
    f[i].y = dy;
  }
  long long l = 0, r = 1e14 + 5;
  long long mid;
  if (check(r) == 0) {
    cout << "-1";
    return 0;
  }
  while (l < r) {
    mid = l + (r - l) / 2;
    if (check(mid)) {
      r = mid;
    } else
      l = mid + 1;
  }
  cout << l;
  return 0;
}
