Longest Palindromic Subarray

Problem Description

Given an array $a_1, a_2, \dots, a_n$ of length $n$, find the length of the longest palindromic contiguous subarray.

A subarray $a_l, a_{l+1}, \dots, a_r$ is palindromic if reading it forward is the same as reading it backward, i.e. $a_l = a_r$, $a_{l+1} = a_{r-1}$, $\dots$.

Input Format

The first line contains an integer $n$, the number of elements.

The next line contains $n$ integers $a_1, a_2, \dots, a_n$.

Output Format

One integer, the answer.

Sample Input

6
1 2 3 3 2 4

Sample Output

4

Constraints

For $100\%$ of the data: $1 \leq n \leq 100000$, $1 \leq a_i \leq 1000$.