Problem: You are a coach at your local university. There are n students under your supervision, the programming skill of the i-th student is a_i.

You have to create a team for a new programming competition. As you know, the more students some team has the more probable its victory is! So you have to create a team with the maximum number of students. But you also know that a team should be balanced. It means that the programming skill of each pair of students in a created team should differ by no more than 5.

Your task is to report the maximum possible number of students in a balanced team.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of students.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is a programming skill of the i-th student.

Output

Print one integer — the maximum possible number of students in a balanced team.

Examples

Input


6
1 10 17 12 15 2


Output


3


Input


10
1337 1337 1337 1337 1337 1337 1337 1337 1337 1337


Output


10


Input


6
1 1000 10000 10 100 1000000000


Output


1

Note

In the first example you can create a team with skills [12, 17, 15].

In the second example you can take all students in a team because their programming skills are equal.

In the third example you can create a team consisting of a single student (and you cannot create a team consisting of at least two students).

Solution (in JAVA):

Solution:
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;

public class BalancedTeam {

    public static class KeyInfo implements Comparable<KeyInfo>{
        public final int key;
        public final int value;

        public KeyInfo(int key, int value) {
            this.key = key;
            this.value = value;
        }

        @Override
        public int compareTo(KeyInfo o) {
            return Integer.compare(this.key, o.key);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        scanner.nextLine();

        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < n; i++) {
            int num = scanner.nextInt();
            if (map.containsKey(num)) {
                map.put(num, map.get(num) + 1 );
            }else{
                map.put(num, 1);
            }
        }

        List<KeyInfo> collect = map.entrySet().stream().map(e -> new KeyInfo(e.getKey(), e.getValue())).collect(Collectors.toList());
        Collections.sort(collect);

        int i = 0;
        int j = 1;
        int currentChunk = collect.get(0).value;
        int biggestChunk = currentChunk;

        while (j < collect.size()) {
            KeyInfo k2 = collect.get(j);

            while (i < collect.size() && k2.key - collect.get(i).key > 5) {
                currentChunk -= collect.get(i).value;
                i++;
            }

            currentChunk += k2.value;
            if (currentChunk > biggestChunk) {
                biggestChunk = currentChunk;
            }

            // 3 4 10 11
            j++;
        }
        System.out.println(biggestChunk);

        // 1 2 10 10 12 15 17

    }
}