def calcfame(n, i):
    ret = 0
    itr = 0
    while n > 0:
        if i == itr:
            ret += 2 * n
            break
        ret += n
        n //= 2
        itr += 1
    return ret

N = int(input())
f0 = calcfame(N, 10000000000000)
maxf = 0
for i in range(31):
    maxf = max(maxf, calcfame(N, i))
print(maxf - f0)