{"raw_statement":[{"iden":"problem statement","content":"Given is a permutation $P=(P_1,P_2,\\ldots,P_N)$ of the integers from $1$ through $N$.\nFind the number of pairs of integers $(i,j)$ such that $1\\leq i\\leq j\\leq N$ satisfying $GCD(i,j)\\neq 1$ and $GCD(P_i,P_j)\\neq 1$.  \nHere, for positive integers $x$ and $y$, $GCD(x,y)$ denotes the greatest common divisor of $x$ and $y$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2\\times 10^5$\n*   $(P_1,P_2,\\ldots,P_N)$ is a permutation of $(1,2,\\ldots,N)$.\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$P_1$ $P_2$ $\\ldots$ $P_N$"},{"iden":"sample input 1","content":"6\n5 1 3 2 4 6"},{"iden":"sample output 1","content":"6\n\nSix pairs $(3,3)$, $(3,6)$, $(4,4)$, $(4,6)$, $(5,5)$, $(6,6)$ satisfy the condition, so $6$ should be printed."},{"iden":"sample input 2","content":"12\n1 2 3 4 5 6 7 8 9 10 11 12"},{"iden":"sample output 2","content":"32"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}