Can anyone help with this question thinking process...✍️

We are initially given a integer number n. Find number of pairs (a,b) such that a*b is a perfect square. 1 <= a,b <= n 1 <= n <= 100000 Example: n =...

We are initially given a integer number n.
Find number of pairs (a,b) such that a*b is a perfect square.
1 <= a,b <= n
1 <= n <= 100000
Example:
n = 4,

output: 6

explaination: (1,1),(2,2),(3,3),(4,4),(1,4),(4,1)