#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
int sx, sy, ex, ey, n;
int dx[N], dy[N];
char s[N];
int main() {
  scanf("%d%d%d%d%d%s", &sx, &sy, &ex, &ey, &n, s + 1);
  for (int i = 1; i <= n; i++) {
    dx[i] = dx[i - 1] - (s[i] == 'L') + (s[i] == 'R');
    dy[i] = dy[i - 1] - (s[i] == 'D') + (s[i] == 'U');
  }
  ll l = 0, r = 2e14, ans = -1;
  while (l <= r) {
    ll mid = (l + r) / 2;
    ll x = sx + (mid / n) * dx[n] + dx[mid % n];
    ll y = sy + (mid / n) * dy[n] + dy[mid % n];
    ll mandist = abs(ex - x) + abs(ey - y);
    if (mandist <= mid) {
      ans = mid;
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  printf("%lld", ans);
}
