#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  long long int l = 0, h = LLONG_MAX;
  long long int n;
  cin >> n;
  string s;
  cin >> s;
  long long int x = 0, y = 0, pos[(long long int)s.size()][2];
  for (long long int i = 0; i < n; i++) {
    if (s[i] == 'U') y++;
    if (s[i] == 'D') y--;
    if (s[i] == 'L') x--;
    if (s[i] == 'R') x++;
    pos[i][0] = x;
    pos[i][1] = y;
  }
  long long int ans = h;
  while (l <= h) {
    long long int mid = l + (h - l) / 2;
    x = 0, y = 0;
    long long int d = mid / n, r = mid % n;
    x = d * pos[n - 1][0];
    y = d * pos[n - 1][1];
    if (r) {
      x += pos[r - 1][0];
      y += pos[r - 1][1];
    }
    if (abs(x + x1 - x2) + abs(y + y1 - y2) <= mid) {
      h = mid - 1;
      ans = mid;
    } else
      l = mid + 1;
  }
  if (ans == LLONG_MAX)
    cout << -1;
  else
    cout << ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
}
