最大奇约数求和

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
#define rep(i,a,b) for(int i = a;i <= b;++ i)
#define per(i,a,b) for(int i = a;i >= b;-- i)
#define mem(a,b) memset((a),(b),sizeof((a)))
#define FIN freopen("in.txt","r",stdin)
#define FOUT freopen("out.txt","w",stdout)
#define IO ios_base::sync_with_stdio(0),cin.tie(0)
#define mid ((l+r)>>1)
#define ls (id<<1)
#define rs ((id<<1)|1)
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
typedef pair<int, int> PIR;
const int N = 1e5+5;

LL n;
int main()
{IO;
//    FIN;
//    FOUT;
    while(cin >> n){
        LL ans = 0;
        while(n){
            if(n&1)    ans += (1+n)*(n/2+1)/2;
            else ans += n*(n/2)/2;
            n >>= 1;
        }
        cout << ans << endl;
    }
    return 0;
}