A famous coder of IIIT Vadodara nicknamed not_false is working on proving a theorem. Before he started his work, a friend of his challenged him to solve a problem, he is working for. This is the lemma -

You are given a graph $G$ having $N$ vertices numbered $1$ to $N$. There is an edge between two vertices $i$ and $j$ $(1 \leq i, \ j \leq N)$ iff

• $|i - j|$ is prime
•  $min(i, j)$ is divisible by $|i-j|$

Your task is simple. Find the number of $\href{https://en.wikipedia.org/wiki/Component_(graph_theory)}{components}$ in the given graph $G$. Also, find the number of edges.

CONSTRAINTS

$1 \leq N \leq 10^{5}$

INPUT FORMAT

A single line containing a single integer $N$

OUTPUT FORMAT

Print two lines, each containing a single integer. The first line contains the number of edges and the second line contains the number of components of the graph.