#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
long long xs, ys, xe, ye;
long long n;
char str[N];
long long dx[N];
long long dy[N];
int main() {
  cin >> xs >> ys >> xe >> ye;
  cin >> n;
  scanf(" %s", str + 1);
  for (int i = 1; i <= n; i++) {
    dx[i] = dx[i - 1];
    dy[i] = dy[i - 1];
    if (str[i] == 'U') dy[i]++;
    if (str[i] == 'D') dy[i]--;
    if (str[i] == 'R') dx[i]++;
    if (str[i] == 'L') dx[i]--;
  }
  long long s = 0, e = 3e14, md, bst = -1;
  while (s <= e) {
    md = s + ((e - s) >> 1);
    long long v1 = md / n;
    long long v2 = md % n;
    long long cx = xs + v1 * dx[n] + dx[v2];
    long long cy = ys + v1 * dy[n] + dy[v2];
    long long rx = cx - xe;
    long long ry = cy - ye;
    if (rx < 0) rx *= -1;
    if (ry < 0) ry *= -1;
    if (rx + ry <= md) {
      bst = md;
      e = md - 1;
    } else
      s = md + 1;
  }
  cout << bst;
  return 0;
}
