// 2019 IUSB Programming Competition
// Round 2 Problem 3
// Find the optimal score for the blocks game
// Solution by Liguo Yu


#include <iostream>
using namespace std;

int calculate(int * b, int p);

int main()
{
	int size;
	cin >> size;
	
	int * arr = new int[size];
	
	for (int i = 0; i < size; i++) cin >> arr[i];
	
	int score = calculate(arr, size);
	cout << score;
	
	delete[] arr;
	
	return 0;
}  

int calculate(int * arr, int size)
{
	int highest = 0;
	
	int i = 0;
	
	while(i<size)
	{
		int s = i;
		
		while(i<size && arr[s]==arr[i]) i= i+1;
		
		int e = i;
		
		int * arr2 = new int [s + size -e];
		
		for (int ii = 0; ii < s; ii++)
		{
			arr2[ii] = arr[ii];
		}

		for (int ii = e; ii < size; ii++)
		{
			arr2[ii+s-e] = arr[ii];
		}

		int siz = s + size -e;
		int result;

		if(siz==0) return result = (e-s)*(e-s);
		else result = (e-s)*(e-s)+ calculate(arr2, siz);

		if(result > highest) highest = result;
		delete[] arr2;
	}
	
	return highest;
}