Odd Divisors

Time limit 1 second

Memory limit 128 MiB

Let f(n) be the greatest odd divisor of n, where n is a positive integer. You are given a positive integer n. Find the sum f(1) + f(2) + ... + f(n).

Input data

Each line contains one positive integer n (n ≤ 10^9).

For each value of n print in a separate line the value of f(1) + f(2) + ... + f(n).

Input example #1

7
1
777

Output example #1

21
1
201537