import os
import sys
from math import sqrt

def factors(n):
    fact=[1,n]
    check=2
    rootn=sqrt(n)
    while check<rootn:
        if n%check==0:
            fact.append(check)
            fact.append(n/check)
        check+=1
    if rootn==check:
        fact.append(check)
        fact.sort()
    return fact

def main():
    tests = xrange(1,10**8)
    sum_lens = 0
    FACTORS = {}

    # TODO: Make it faster than going through and finding each set of factors
    for test in tests:
        if test not in FACTORS:
            FACTORS[test] = factors(test)
        chain_len = len(FACTORS[test])
        if chain_len % 2 != 0:
            chain_len = chain_len/2 + 1
        else:
            chain_len = chain_len/2

        possible_chain = FACTORS[test][:chain_len]
        # TODO: Find the longest chain
        sum_lens += len(possible_chain)

    print sum_lens

if __name__ == "__main__":
    sys.exit(main())