Given a sorted array $A$ of $n$ integers. For each index $i$, find the number of elements in the array that lie between $A_i$ and $2 \cdot A_i$ inclusive. \InputFile The first line contains the size $n~(n \le 10^5)$ of array $A$. The second line contains $n$ integers, each ranging from $0$ to $10^9$, in sorted order. \OutputFile Print $n$ 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.