#include <bits/stdc++.h>
using namespace std;
const long long mxn = 1e5;
vector<pair<long long, long long> > dist;
long long sx, sy, dx, dy, n;
string s;
bool check(long long k) {
  long long curx = sx + dist[n].first * (k / n) + dist[k % n].first;
  long long cury = sy + dist[n].second * (k / n) + dist[k % n].second;
  return abs(curx - dx) + abs(cury - dy) <= k;
}
void solve() {
  cin >> sx >> sy >> dx >> dy;
  cin >> n;
  cin >> s;
  long long xx = 0, yy = 0;
  dist.emplace_back(0, 0);
  for (char c : s) {
    if (c == 'U') yy++;
    if (c == 'D') yy--;
    if (c == 'L') xx--;
    if (c == 'R') xx++;
    dist.emplace_back(xx, yy);
  }
  long long l = 0, r = 1e18;
  long long ans = -1;
  while (l <= r) {
    long long mid = l + (r - l) / 2;
    if (check(mid)) {
      ans = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cerr.tie(NULL);
  ;
  cout << fixed;
  int test;
  test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
