#include <bits/stdc++.h>
using namespace std;
priority_queue<long long, std::vector<long long>, std::greater<long long> > pqs;
queue<long long> qq;
stack<long long> sta;
set<long long> st;
set<long long>::iterator P;
pair<long long, long long> pp;
vector<long long> v;
map<long long, long long> mp, pm;
long long i, j, n, m, t, k, a, b, c, x, mx, mn;
string s[1005], s1;
char z;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  int T = 1;
  while (T--) {
    i = j = n = m = t = k = a = b = c = x = mx = mn = 0;
    double speed1, speed2, cur = 0.0, wake, re, l, time = 1.0;
    cin >> speed1 >> speed2 >> wake >> re >> l;
    cur = speed1 * wake;
    speed1 /= 3600, speed2 /= 3600, re *= 3600;
    while (cur < l) {
      time = cur / speed2;
      while (time * speed2 < time * speed1 + cur && time * speed1 + cur < l)
        time++;
      cur += time * speed1;
      if (l - cur <= speed1 || cur >= l) break;
      k++, cur += (re + time) * speed1;
    }
    cout << k << endl;
  }
  return 0;
}
