Krypton saikr daily question - CTF

Description

After vaguely entering the University , You decided to take part in the competition and stand out , But you in the computer college , But I found that competition is not equal to E-sports , You choose left and right , Found out acm and ctf, You always wanted to be a hacker , Decided to go ctf Study there , But when ctf There are so many things to learn ,pwn,web, reverse ...., As a sprout, you decide to brush more questions .

The senior assigned you a study plan , Considering that the essence of computer is binary , So you will be 2^121 Brush one question every day for one day ,2^222 Brush two questions every day for one day , That is to say 1,21,2 Brush one question every day , The first 33 To 66 Brush two questions every day ,2^x2x Brush every day xx topic , And so on , With the basis of algorithm, you decide to write a program to see how many problems you want to write in the specified number of days

Input

An integer tt Days (1 \leq t \leq 10^7)(1≤t≤107).

Output

An integer xx Indicates the number of topics to brush .

Sample Input 1

9

Sample Output 1

19

The code is as follows ：

#include<iostream>
#include<cmath>
using namespace std;
int n, sum = 0;

int main()
{
	ios::sync_with_stdio(false);
	cout.tie(NULL);
	
	cin >> n;
	int i = 1;
	while(n - pow(2, i) > 0)
	{
		sum += i * pow(2, i);
		n -= pow(2, i);
		i ++;
	}
	sum += n * i;
	cout << sum;
	return 0;
}