{"raw_statement":[{"iden":"problem statement","content":"Ringo loves the integer $200$. Solve the problem below for him.  \nGiven a sequence $A$ of $N$ positive integers, find the pair of integers $(i, j)$ satisfying all of the following conditions:\n\n*   $1 \\le i < j \\le N$;\n*   $A_i - A_j$ is a multiple of $200$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $2 \\le N \\le 2 \\times 10^5$\n*   $1 \\le A_i \\le 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\dots$ $A_N$"},{"iden":"sample input 1","content":"6\n123 223 123 523 200 2000"},{"iden":"sample output 1","content":"4\n\nFor example, for $(i, j) = (1, 3)$, $A_1 - A_3 = 0$ is a multiple of $200$.  \nWe have four pairs satisfying the conditions: $(i,j)=(1,3),(1,4),(3,4),(5,6)$."},{"iden":"sample input 2","content":"5\n1 2 3 4 5"},{"iden":"sample output 2","content":"0\n\nThere may be no pair satisfying the conditions."},{"iden":"sample input 3","content":"8\n199 100 200 400 300 500 600 200"},{"iden":"sample output 3","content":"9"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}