{"raw_statement":[{"iden":"problem statement","content":"You are given an integer $N$. Find the number of pairs $(i,j)$ of positive integers at most $N$ that satisfy the following condition:\n\n*   $i \\times j$ is a square number."},{"iden":"constraints","content":"*   $1 \\le N \\le 2 \\times 10^5$\n*   $N$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"4"},{"iden":"sample output 1","content":"6\n\nThe six pairs $(1,1),(1,4),(2,2),(3,3),(4,1),(4,4)$ satisfy the condition.\nOn the other hand, $(2,3)$ does not, since $2 \\times 3 =6$ is not a square number."},{"iden":"sample input 2","content":"254"},{"iden":"sample output 2","content":"896"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}