#include <bits/stdc++.h>
using namespace std;
void DSUinit(vector<long long int>& a, vector<long long int>& size,
             long long int n) {
  for (long long int i = 0; i < n; i++) {
    a[i] = i;
    size[i] = 1;
  }
  return;
}
long long int root(vector<long long int>& a, long long int i) {
  return (i == a[i]) ? i : a[i] = root(a, a[i]);
}
bool DSUfind(vector<long long int> a, long long int x, long long int y) {
  if (root(a, x) == root(a, y)) {
    return true;
  }
  return false;
}
void DSUunion(vector<long long int>& a, vector<long long int>& size,
              long long int x, long long int y) {
  x = root(a, x);
  y = root(a, y);
  if (x == y) {
    return;
  }
  if (size[x] < size[y]) swap(x, y);
  a[y] = x;
  size[x] += size[y];
}
void dfs(vector<vector<long long int> >& graph, vector<bool>& visited,
         long long int start) {
  visited[start] = true;
  for (long long int i = 0; i < graph[start].size(); i++) {
    if (!(visited[graph[start][i]])) {
      dfs(graph, visited, graph[start][i]);
    }
  }
  return;
}
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> v(n, 0);
  for (long long int i = 0; i < n; i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end());
  vector<long long int> dp(n, 1);
  long long int ma = 1;
  for (long long int i = 1; i < n; i++) {
    if (2 * v[i - 1] >= v[i]) {
      dp[i] = dp[i - 1] + 1;
      ma = max(dp[i], ma);
    }
  }
  cout << ma << "\n";
  return 0;
}
