#include <bits/stdc++.h>
using namespace std;
long long a, b, x, y, n;
vector<pair<long long, long long> > pre(100005);
bool check(long long mid) {
  long long valx = a + pre[n].first * (mid / n) + pre[mid % n].first;
  long long valy = b + pre[n].second * (mid / n) + pre[mid % n].second;
  return ((abs(x - valx) + abs(y - valy)) <= mid);
}
void solve() {
  cin >> a >> b >> x >> y;
  string str;
  cin >> n >> str;
  pre.resize(n + 1);
  pre[0] = {0, 0};
  long long low = 0, high = 1e15, mid, ans = -1, i;
  for (i = 1; i <= n; i++) {
    pre[i] = pre[i - 1];
    char c = str[i - 1];
    if (c == 'U')
      pre[i].second += 1;
    else if (c == 'D')
      pre[i].second -= 1;
    else if (c == 'R')
      pre[i].first += 1;
    else
      pre[i].first -= 1;
  }
  while (low <= high) {
    mid = (low + high) / 2;
    if (check(mid)) {
      high = mid - 1;
      ans = mid;
    } else
      low = mid + 1;
  }
  cout << ans << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
