跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1790. Misha and Palindrome Degree

  • ID: 1796
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:挑战
  • 上传者:
  • 二分
  • 组合数学
  • 模拟
  • 算法思想
  • 数学
  • 编程与模拟
  • 挑战
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Misha and Palindrome Degree

题目描述

E. Misha and Palindrome Degree
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Misha has an array of n integers indexed by integers from 1 to n. Let's define palindrome degree of array a as the number of such index pairs (l,r)(1≤l≤r≤n), that the elements from the l-th to the r-th one inclusive can be rearranged in such a way that the whole array will be a palindrome. In other words, pair (l,r) should meet the condition that after some rearranging of numbers on positions from l to r, inclusive (it is allowed not to rearrange the numbers at all), for any 1≤i≤n following condition holds: a[i]=a[n-i+1].

Your task is to find the palindrome degree of Misha's array.

Input

The first line contains integer n (1≤n≤105).

The second line contains n positive integers a[i] (1≤a[i]≤n), separated by spaces − the elements of Misha's array.

Output

In a single line print the answer to the problem.

Examples
Input
3
2 2 2
Output
6
Input
6
3 6 5 3 3 5
Output
0
Input
5
5 5 2 5 2
Output
4
Note

In the first sample test any possible pair (l,r) meets the condition.

In the third sample test following pairs (1,3),(1,4),(1,5),(2,5) meet the condition.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1347 题。保留原作者与原赛事署名。