#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long a[5], x1, y11, x2, y2, n;
int dx[N], dy[N];
string s;
bool valid(long long m) {
  long long a = m / n;
  long long b = m % n;
  long long x = a * dx[n] + dx[b] + x1;
  long long y = a * dy[n] + dy[b] + y11;
  long long ans = abs(x - x2) + abs(y - y2);
  return ans <= m;
}
int main() {
  cin >> x1 >> y11 >> x2 >> y2 >> n >> s;
  for (int i = 0; i < n; i++) {
    dx[i + 1] = dx[i];
    dy[i + 1] = dy[i];
    if (s[i] == 'U') dy[i + 1]++;
    if (s[i] == 'D') dy[i + 1]--;
    if (s[i] == 'L') dx[i + 1]--;
    if (s[i] == 'R') dx[i + 1]++;
  }
  long long L = 0, R = 1e18, ans = -1;
  while (L <= R) {
    long long mid = L + R >> 1;
    if (valid(mid)) {
      R = mid - 1;
      ans = mid;
    } else
      L = mid + 1;
  }
  cout << ans << endl;
}
