A. Ilya and a Colorful Walk

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Ilya lives in a beautiful city of Chordalsk.

There are n houses on the street Ilya lives, they are numerated from 1 to n from left to right; the distance between every two neighboring houses is equal to 1 unit. The neighboring houses are 1 and 2, 2 and 3, …, n−1 and n. The houses n and 1 are not neighboring.

The houses are colored in colors c1,c2,…,cn so that the i-th house is colored in the color ci. Everyone knows that Chordalsk is not boring, so there are at least two houses colored in different colors.

Ilya wants to select two houses i and j so that 1≤i<j≤n, and they have different colors: ci≠cj. He will then walk from the house i to the house j the distance of (j−i) units.

Ilya loves long walks, so he wants to choose the houses so that the distance between them is the maximum possible.

Help Ilya, find this maximum possible distance.

Input

The first line contains a single integer n (3≤n≤300000) — the number of cities on the street.

The second line contains n integers c1,c2,…,cn (1≤ci≤n) — the colors of the houses.

It is guaranteed that there is at least one pair of indices i and j so that 1≤i<j≤n and ci≠cj.

Output

Print a single integer — the maximum possible distance Ilya can walk.

Examples

input

5
1 2 3 2 3

output

4

input

3
1 2 1

output

1

input

7
1 1 3 1 1 1 1

output

4

Note

In the first example the optimal way is to walk from the first house to the last one, where Ilya can walk the distance of 5−1=4 units.

In the second example the optimal way is to either walk from the first house to the second or from the second to the third. Both these ways have the distance of 1 unit.

In the third example the optimal way is to walk from the third house to the last one, where Ilya can walk the distance of 7−3=4 units.

思路：

分两种情况，第一种第一个与最后一个不相相同的情况，那么最大值为n-1；第二种第一个与最后一个相同的情况，那么从前向后找与第一个不同的与从后向前找与最后一个不同的，要最大的那个就行了。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
using namespace std;
int main(){
	 int n,maxn;
	 while(cin>>n){
	 	int m,ww=n;
	 	vector<int>q;
	 	while(ww--){
	 		cin>>m;
	 		q.push_back(m);
		 }
		 maxn=0;
		 if(q[0]==q[n-1]){
		 	for(int i=1;i<=n-2;i++){
				if(q[i]!=q[i-1]){
					if((n-i-1)>maxn){
						maxn=n-i-1;
						}
					}
				}
				for(int i=n-2;i>=0;i--){
				if(q[i]!=q[i+1]){
					if(i>maxn){
						maxn=i;
					}
				}
			}
		 }
		 else{
				maxn=n-1;
		 }
		 cout<<maxn<<endl;
		 q.clear();
	 }
	return 0;
}