Perfect Square Pairs#12428
Given an integer . Find the number of pairs such that:
1 \le a < b \le n,
a \cdot b is a perfect square.
One integer n~(1 \le n \le 10^6).
Print the answer to the problem. Since the answer can be large, print it modulo 10^9 + 7.
Example 1
Example 2