Given N sweets, each has a unique sweetness level. Sweets are sorted in incresing order according to the sweetness. Now you select a subset of sweets to eat. The only condition to satisfy while selecting the sweets is that, for every selected candy(except the last one) the sweetness of next candy should not be more then twice the sweetness of current candy.

For example, if you selected k candies with sweetness A₁,A₂,A₃,...,A_k, then for each j from 1 to k-1, A_j+1 <= 2A_j should hold.

You want to eat maximum number of candies. Tell maximum number of candies that you can eat.

INPUT

First line of input contains N, number  of candies.
Next line contains N integers A₁,A₂,A₃,...,A_n, sweetness of candies.

OUTPUT

Output a single integer denoting maximum number of candies you can eat.

CONSTRAINTS

1<=N<=10⁵
1<=A_i<=10⁹

SAMPLE TEST CASE 1

4
3 7 15 34

SAMPLE OUTPUT 1

1