#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
const long long LLINF = 1000000000000000007LL;
const double EPS = 1e-9;
const int sz = 100100;
pair<long long, long long> s[sz];
long long xa, ya, xb, yb, n;
long long binser() {
  long long l = 0, r = LLINF;
  for (int i = 0; i < 100; ++i) {
    long long md = (l + r) / 2;
    long long x = s[n].first * (md / n) + s[md % n].first + xa;
    long long y = s[n].second * (md / n) + s[md % n].second + ya;
    if (abs(xb - x) + abs(yb - y) <= md) {
      r = md;
    } else {
      l = md;
    }
  }
  return r;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> xa >> ya >> xb >> yb >> n;
  string str;
  cin >> str;
  for (int i = 0; i < n; ++i) {
    if (str[i] == 'U') s[i + 1].second++;
    if (str[i] == 'D') s[i + 1].second--;
    if (str[i] == 'L') s[i + 1].first--;
    if (str[i] == 'R') s[i + 1].first++;
    s[i + 2] = s[i + 1];
  }
  long long res = binser();
  if (res == LLINF)
    cout << -1;
  else
    cout << res;
}
