Problem Statement

Given integers $L$ and $L,R\ (L \le R)$, find the number of pairs $(x,y)$ of integers satisfying all of the conditions below:

• $L \le x,y \le R$
• Let $g$ be the greatest common divisor of $x$ and $y$. Then, the following holds.
• $g \neq 1$, $\frac{x}{g} \neq 1$, and $\frac{y}{g} \neq 1$.

Constraints

• All values in input are integers.
• $1 \le L \le R \le 10^6$

Input

Input is given from Standard Input in the following format:

L R

Output

Print the answer as an integer.