{"raw_statement":[{"iden":"problem statement","content":"You are given an integer sequence of length $N$, $a_1,a_2,...,a_N$.\nFor each $1≤i≤N$, you have three choices: add $1$ to $a_i$, subtract $1$ from $a_i$ or do nothing.\nAfter these operations, you select an integer $X$ and count the number of $i$ such that $a_i=X$.\nMaximize this count by making optimal choices."},{"iden":"constraints","content":"*   $1≤N≤10^5$\n*   $0≤a_i<10^5 (1≤i≤N)$\n*   $a_i$ is an integer."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ .. $a_N$"},{"iden":"sample input 1","content":"7\n3 1 4 1 5 9 2"},{"iden":"sample output 1","content":"4\n\nFor example, turn the sequence into $2,2,3,2,6,9,2$ and select $X=2$ to obtain $4$, the maximum possible count."},{"iden":"sample input 2","content":"10\n0 1 2 3 4 5 6 7 8 9"},{"iden":"sample output 2","content":"3"},{"iden":"sample input 3","content":"1\n99999"},{"iden":"sample output 3","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}