https://codeforces.com/contest/1029/problem/B
/*
*@Author: STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
using namespace std;
typedef long long ll;
const int N=2e5+100;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m;
int a[N];
int main()
{
#ifdef DEBUG
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int l=1,r=1;
int ans=1;
for(int i=2;i<=n;i++){
if(a[i-1]<a[i]&&2*a[i-1]>=a[i]){
r++;
}else{
ans=max(ans,r-l+1);
l=i;
r=i;
}
}
ans=max(ans,r-l+1);
cout << ans << endl;
//cout << "Hello world!" << endl;
return 0;
}