#include <bits/stdc++.h>
using namespace std;
long long int X1, Y1, X2, Y2, n;
pair<long long int, long long int> pre[100007];
int main() {
  scanf("%lld%lld%lld%lld%lld", &X1, &Y1, &X2, &Y2, &n);
  char c;
  for (int i = 1; i <= n; i++) {
    scanf(" %c", &c);
    pre[i] = pre[i - 1];
    if (c == 'U') pre[i].second++;
    if (c == 'D') pre[i].second--;
    if (c == 'L') pre[i].first--;
    if (c == 'R') pre[i].first++;
  }
  long long int first, second, d;
  long long int high = 200000000000007LL, mid, low = 0;
  while (low < high) {
    mid = (high + low) / 2;
    first = X1 + pre[n].first * (mid / n) + pre[mid % n].first;
    second = Y1 + pre[n].second * (mid / n) + pre[mid % n].second;
    d = llabs(X2 - first) + llabs(Y2 - second);
    if (d <= mid)
      high = mid;
    else
      low = mid + 1;
  }
  if (high == 200000000000007LL)
    printf("-1\n");
  else
    printf("%lld\n", high);
}
