Geek's file currently has zero lines of codes. Each morning geek can add some arbitrary lines of code(possibly zero too). Each night, each line of the code splits into two lines. Geek wants N lines of code at some moment. Find the minimum lines of code geek adds.
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a single integer N.
Output: For each test case, print the answer
1. 1 <= T <= 105
2. 1 <= N <= 109
Test Case 1: The first-morning geek can add one line of code, then in the next morning geek file will contain 2 lines of code, and then geek again can add one line of code, then in the next morning geek file will contain 6 lines of code and then geek again can add one line of code, then in the next morning geek file will contain 14. So, in the whole process geek adds 3 lines of code.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes