#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long x1, y1;
  cin >> x1 >> y1;
  long long x2, y2;
  cin >> x2 >> y2;
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long tx = 0, ty = 0;
  auto X = vector<long long>(n);
  auto Y = vector<long long>(n);
  for (auto i = 0; i < n; ++i) {
    long long px = i ? X[i - 1] : x1;
    long long py = i ? Y[i - 1] : y1;
    X[i] = px, Y[i] = py;
    if (s[i] == 'L')
      X[i]--, tx--;
    else if (s[i] == 'R')
      X[i]++, tx++;
    else if (s[i] == 'U')
      Y[i]++, ty++;
    else
      Y[i]--, ty--;
  }
  auto check = [&](long long m) {
    long long x = m ? (m - 1) / n * tx + X[(m - 1) % n] : x1;
    long long y = m ? (m - 1) / n * ty + Y[(m - 1) % n] : y1;
    return llabs(x - x2) + llabs(y - y2) <= m;
  };
  long long l = -1, r = 2ll * 1e14 + 1;
  while (l + 1 < r) {
    long long m = (l + r) / 2;
    if (check(m))
      r = m;
    else
      l = m;
  }
  if (r == 2ll * 1e14 + 1)
    cout << -1 << endl;
  else
    cout << r << endl;
}
int main() {
  cin.sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}
