Stepan is interested in the greatest common divisor of a pair of numbers, specifically GCD(x,y). Given an integer n, Stepan wants to know how many pairs of integers (i,j) exist such that 1≤i,j≤n and the equation i=GCD(i,j) is satisfied.
One integer n(1≤n≤106).
Print the number of required pairs.