Given a sorted array of integers. For each index , find the number of elements in the array that lie between A_i and 2 \cdot A_i inclusive.
The first line contains the size n~(n \le 10^5) of array . The second line contains integers, each ranging from to 10^9, in sorted order.
Print integers. For each index i~(1 \le i \le n) of the array, print the number of elements lying between A_i and 2 \cdot A_i inclusive.
Example 1