Problem:
Score : 300 points

Problem Statement

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 select an integer X and count the number of i such that a_i=X.

Maximize this count by making optimal choices.

Constraints

1≤N≤10^5

0≤a_i<10^5 (1≤i≤N)

a_i is an integer.

Input

The input is given from Standard Input in the following format:

N
a_1 a_2 .. a_N

Output

Print the maximum possible number of i such that a_i=X.

Sample Input 1

7
3 1 4 1 5 9 2

Sample Output 1

4

For example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.

Sample Input 2

10
0 1 2 3 4 5 6 7 8 9

Sample Output 2

3

Sample Input 3

1
99999

Sample Output 3

1

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
import java.util.Arrays;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        int[] c = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
            c[i] = 1;
        }

        Arrays.sort(a);

        int count = 1;
        int[] b = new int[n];
        int k = 0;

        for (int i = 0; i < n - 1; i++) {
            if (a[i] != a[i + 1]) {
                b[k] = a[i];
                k++;
                if (i == n - 2) {
                    b[k] = a[i + 1];
                    k++;
                }
            } else {
                c[k]++;
            }
        }
        int countmax = 1;
        int countmax1 = 1;
        int countmax2 = 1;
        int countmax3 = 1;
        if (k == 0) countmax = c[k];
        else if (k == 1) {
            if ((Math.abs((b[0] - b[1]))) <= 2) {
                countmax = c[0] + c[1];
            } else {
                if (c[0] > c[1]) countmax = c[0];
                else countmax = c[1];
            }
        } else {
            for (int i = 0; i < k - 1; i++) {
                if (countmax1<c[i]) countmax1 = c[i];
                if (Math.abs(b[i] - b[i+1])<=2) {
                    if (countmax2 <= c[i] + c[i + 1]) countmax2 = c[i] + c[i + 1];
                }
                if (i > 0) {
                    if ((b[i - 1] + b[i] + b[i + 1])  == 3*b[i]) {
                        count = c[i - 1] + c[i] + c[i + 1];
                        if (countmax3 <= count) countmax3 = count;
                    }
                }
            }
            if(countmax1<c[k-1]) countmax1 = c[k-1];
            countmax = countmax1;
            if (countmax < countmax2) {
                countmax = countmax2;
            }
            if (countmax < countmax3) {
                countmax = countmax3;
            }
        }
        System.out.println(countmax);

    }
}