def gcd(a, b):
    while b:
        a, b = b, a % b
    return a
def lcm(a, b):
    return a * b // gcd(a, b)
def c(*ar):
    return reduce(lcm, ar)
def a(n):
    if n==0:
        return 1
    x=c(*range(1,n+1))
    return x
def M(n):
    x=bin(int(n))[2:]
    s=0
    for i in range(1,len(x)):
        if x[i-1]=="1" and x[i]=="0":
            s+=i
    return s
for i in range(0, 10001):
    print str(i)+" "+str(M(a(i)))