Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6454
@blackshadows 6380
@mb1973 5710
@Quandray 5245
@akhayrutdinov 5111
@saiujwal13083 5046
@sanjay05 3762
@kirtidee18 3709
@mantu_singh 3556
@marius_valentin_dragoi 3523
@sushant_a 3459
Complete Leaderboard
Geek and Code
Easy Accuracy: 58.43% Submissions: 493 Points: 2

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.

Input:
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

Constraints:
1. 1 <= T <= 105

2. 1 <=  N <= 109

Example:
Input:

2
14
1

Output:
3
1


Explanation:
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.

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Geek and Code

Output Window