N = int(eval(input()))

def num_divisors_table(n):

    table = [0]*(n+1) 

    for i in range(1,n+1):

        for j in range(i,n+1,i):

            table[j] += 1

    return table

print((sum(num_divisors_table(N)[:-1])))
def DivisorsTable(N):

    DivTable = [0]*(N+1) 

    for I in range(1,N+1):

        for J in range(I,N+1,I):

            DivTable[J] += 1

    return sum(DivTable)

print((DivisorsTable(int(eval(input()))-1)))
N = int(eval(input()))


def num_divisors_table(n):
    table = [0] * (n + 1)
    for i in range(1, n + 1):
        for j in range(i, n + 1, i):
            table[j] += 1
    return table


print((sum(num_divisors_table(N)[:-1])))

def DivisorsTable(N):
    DivTable = [0] * (N + 1)
    for I in range(1, N + 1):
        for J in range(I, N + 1, I):
            DivTable[J] += 1
    return sum(DivTable)


print((DivisorsTable(int(eval(input())) - 1)))

-N = int(eval(input())) +def DivisorsTable(N): +    DivTable = [0] * (N + 1) +    for I in range(1, N + 1): +        for J in range(I, N + 1, I): +            DivTable[J] += 1 +    return sum(DivTable) -def num_divisors_table(n): -    table = [0] * (n + 1) -    for i in range(1, n + 1): -        for j in range(i, n + 1, i): -            table[j] += 1 -    return table - - -print((sum(num_divisors_table(N)[:-1]))) +print((DivisorsTable(int(eval(input())) - 1)))