#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:16777000")
int power(int a, int b) {
  int answer = 1;
  while (b-- > 0) answer *= a;
  return answer;
}
long long power(long long a, long long b) {
  long long answer = 1;
  while (b-- > 0) answer *= a;
  return answer;
}
int example[8] = {0, 1, 2, 3, 4, 5, 6, 7};
void Next(int k) {
  int last = example[k - 1];
  for (int i = k - 2; i >= 0; i--) {
    if (example[i] < last) {
      for (int j = k - 1; j >= 0; j--) {
        if (example[j] > example[i]) {
          int temp = example[j];
          example[j] = example[i];
          example[i] = temp;
          break;
        }
      }
      for (int j = i + 1; j < (k - i - 1) / 2 + i + 1; j++) {
        int temp = example[j];
        example[j] = example[k - j + i];
        example[k - j + i] = temp;
      }
      break;
    }
    last = example[i];
  }
}
int min(int a, int b) {
  if (a < b) return a;
  return b;
}
int max(int a, int b) {
  if (a > b) return a;
  return b;
}
long long min(long long a, long long b) {
  if (a < b) return a;
  return b;
}
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
void QuickSort(int **a, long N) {
  long i = 0, j = N;
  int temp, p;
  p = a[N >> 1][0];
  do {
    while (a[i][0] > p) i++;
    while (a[j][0] < p) j--;
    if (i <= j) {
      temp = a[i][0];
      a[i][0] = a[j][0];
      a[j][0] = temp;
      temp = a[i][1];
      a[i][1] = a[j][1];
      a[j][1] = temp;
      i++;
      j--;
    }
  } while (i <= j);
  if (j > 0) QuickSort(a, j);
  if (N > i) QuickSort(a + i, N - i);
}
long long fact(long long a, long long b) {
  long long answer = 1;
  for (int i = a; i < b + 1; i++) answer *= i;
  return answer;
}
int main() {
  double vp, vd, t, f, c;
  scanf("%lf %lf %lf %lf %lf", &vp, &vd, &t, &f, &c);
  double princpos = vp * t;
  double drakpos = 0;
  int count = 0;
  if (vp - 1e-5 >= vd) {
    printf("0\n");
    return 0;
  }
  while (true) {
    double x = princpos / (vd - vp);
    if (x * vp + princpos + 1e-5 >= c) break;
    princpos = princpos + x * vp;
    drakpos = 0;
    princpos = princpos + princpos / vd * vp + f * vp;
    count++;
  }
  printf("%d\n", count);
  return 0;
}
