LogiQuest

445. Longest Harmonious Subsequence

EasyHash Map

A harmonious subsequence has max − min exactly 1. Print the length of the longest one, or 0.

Input format

Line 1: n Line 2: n integers

Output format

The length.

Example 1

Input

8
1 3 2 2 5 2 3 7

Output

5

Example 2

Input

4
1 2 3 4

Output

2

Constraints

1 ≤ n ≤ 10⁵

Read input from standard input and print the answer to standard output. Your code is judged against 5 test cases, most of them hidden.

Loading the MyLoginn IDE…