SP7960 MULPAL - Multiplicative Palindrome

Given a sequence of N integers. Find two disjoint contiguous palindromic subsequences. Lets call them X and Y. Your task is to find X and Y such that product of their lengths is maximal possible.

`First line will contain one integer N (1 `

`First and only line of output should contain only one integer, the maximum possible product from the text of problem.`