#include <bits/stdc++.h>
using namespace std;
int binary_search_aux(const vector<int>& arr, int val, int ini, int end) {
  if (end == ini) {
    return ini;
  }
  if (end < ini) {
    cout << "ESTAMOS JODIDOS" << endl;
  }
  int med = ini + (end - ini) / 2;
  if (val > arr[med]) {
    return binary_search_aux(arr, val, med + 1, end);
  } else {
    return binary_search_aux(arr, val, ini, med);
  }
}
int binary_search(const vector<int>& arr, int val) {
  return binary_search_aux(arr, val, 0, arr.size());
}
int main() {
  int n;
  cin >> n;
  vector<int> arr(n, 0);
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  int current_meeting_cond = 1;
  int max_meeting_cond = 1;
  for (int i = 0; i < n - 1; ++i) {
    if (arr[i + 1] <= arr[i] * 2) {
      current_meeting_cond++;
      if (current_meeting_cond > max_meeting_cond) {
        max_meeting_cond = current_meeting_cond;
      }
    } else {
      current_meeting_cond = 1;
    }
  }
  cout << max_meeting_cond << endl;
  return 0;
}
