Three Best Friends $AMAN$ , $AKBAR$ , $ANTHONY$ are planning to go to “GOA”  , but just like every other goa trip plan there is a problem to their plan too.
Their parents will only give permission if they can solve this problem for them
They are a given a number N and they have to calculate the total number of triplets (x ,y ,z)
Satisfying the given condition  y * x +z=n.
For ex if N=3
Then there exist 3 triplets( x ,y ,z):   (1,1,2) , (1,2,1) , (2,1,1) which satisfy the condition
Help the group to get permission for the trip

-----Input:-----
- First line will contain the number  $N$.

-----Output:-----
the possible number of triplets satisfying the given condition

-----Constraints-----
- $2 \leq N \leq 10^6$

-----Sample Input:-----
3

-----Sample Output:-----
3

-----EXPLANATION:-----
there exist 3 triplets ( x ,y ,z):   (1,1,2) , (1,2,1) , (2,1,1)  which satisfy the condition

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
import sys

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_ints():
	return list(map(int, sys.stdin.readline().strip().split()))

def input():
	return sys.stdin.readline().strip()
import sys
sys.setrecursionlimit(10 ** 9)
from math import sqrt, ceil, floor
n = int(input())
co = 0
ans = 0
for i in range(1, n):
	ans += n // i
	if n % i == 0:
		ans -= 1
print(ans)


try:
	n = int(input())
	l = [int(i) for i in range(1, n + 1)]
	cnt = 0
	for i in range(1, n + 1):
		for j in range(1, n // i + 1):
			if 1 <= n - i * j <= n:
				cnt += 1
	print(cnt)
except EOFError as e:
	pass


N = int(input())
r = range(1, N + 1)
count = 0
for i in r:
	for j in r:
		if i * j >= N:
			break
		count += 1
print(count)


n = int(input())
ans = 0
for i in range(1, n):
	ans += (n - 1) // i
print(ans)