{"problem":{"name":"Together","description":{"content":"You are given an integer sequence of length $N$, $a_1,a_2,...,a_N$. For each $1≤i≤N$, you have three choices: add $1$ to $a_i$, subtract $1$ from $a_i$ or do nothing. After these operations, you selec","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc082_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1≤N≤10^5$\n*   $0≤a_i<10^5 (1≤i≤N)$\n*   $a_i$ is an integer.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ .. $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc082_a","tags":[],"sample_group":[["7\n3 1 4 1 5 9 2","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."],["10\n0 1 2 3 4 5 6 7 8 9","3"],["1\n99999","1"]],"created_at":"2026-03-03 11:01:13"}}