#include <bits/stdc++.h>
using namespace std;
int a[200100], n;
bool has[200100];
int main() {
  int ans;
  while (~scanf("%d", &n)) {
    ans = 0;
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (int i = 2; i <= n; ++i) has[i] = (a[i] <= 2 * a[i - 1]);
    for (int i = 2; i <= n; ++i) {
      int x = 0;
      while (i <= n && has[i]) {
        ++x;
        ++i;
      }
      ans = max(ans, x);
    }
    printf("%d\n", ans + 1);
  }
  return 0;
}
