題目連結

Description

You are given a problemset consisting of $n$ problems. The difficulty of the $i$-th problem is $a_i$. It is guaranteed that all difficulties are distinct and are given in the increasing order.

You have to assemble the contest which consists of some problems of the given problemset. In other words, the contest you have to assemble should be a subset of problems (not necessary consecutive) of the given problemset. There is only one condition that should be satisfied: for each problem but the hardest one (the problem with the maximum difficulty) there should be a problem with the difficulty greater than the difficulty of this problem but not greater than twice the difficulty of this problem. In other words, let $a_{}$

i1,ai2,⋯ ,aipa_{i_1},a_{i_2},\cdots,a_{i_p} be the difficulties of the selected problems in increasing order. Then for each $j$ from $1$ to $p−1,a_{i_j}+1≤a_{i_j}\times2$ should hold. It means that the contest consisting of only one problem is always valid.

Among all contests satisfying the condition above you have to assemble one with the maximum number of problems. Your task is to find this number of problems.

Input

The first line of the input contains one integer $n$ $(1≤n≤2\times10^5)$ — the number of problems in the problemset.

The second line of the input contains n integers $a_{}$

1,a2,⋯ ,ana_1,a_2,\cdots,a_n $(1≤a_i≤10^9)$ — difficulties of the problems. It is guaranteed that difficulties of the problems are distinct and are given in the increasing order.

Output

Print a single integer — maximum number of problems in the contest satisfying the condition in the problem statement.

Examples

Input

10 1 2 5 6 7 10 21 23 24 49

Output

4

Input

5 2 10 50 110 250

Output

1

Input

6 4 7 12 100 150 199

Output

3

Note

Description of the first example: there are $10$ valid contests consisting of $1$ problem, $10$ valid contests consisting of $2$ problems $([1,2],[5,6],[5,7],[5,10],[6,7],[6,10],[7,10],[21,23],[21,24],[23,24])$, $5$ valid contests consisting of $3$ problems $([5,6,7],[5,6,10],[5,7,10],[6,7,10],[21,23,24])$ and a single valid contest consisting of $4$ problems $([5,6,7,10])$.

In the second example all the valid contests consist of $1$ problem.

In the third example are two contests consisting of $3$ problems: $[4,7,12]$ and $[100,150,199]$.

最初把題目看錯了……交了兩遍反應過來。就只需要貪心地把可加入的合併到一段裡去，不能加入的開新的一段。

#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2e5+10;
int a[N],ans,n;
int main()
{
	//freopen("in.txt","r",stdin);
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	    scanf("%d",&a[i]);
	for(int i=0;i<n;i++)
	{
		int pos=i;
		while(pos+1<n&&a[pos+1]<=a[pos]*2)pos++;
		ans=max(ans,pos-i+1);
		i=pos;
	}
	printf("%d\n",ans);
	return 0;
}

總結

仔細審題很重要