Problem: You are given a non-empty string s consisting of lowercase letters. Find the number of pairs of non-overlapping palindromic substrings of this string.

In a more formal way, you have to find the quantity of tuples (a, b, x, y) such that 1 ≤ a ≤ b < x ≤ y ≤ |s| and substrings s[a... b], s[x... y] are palindromes.

A palindrome is a string that can be read the same way from left to right and from right to left. For example, "abacaba", "z", "abba" are palindromes.

A substring s[i... j] (1 ≤ i ≤ j ≤ |s|) of string s = s1s2... s|s| is a string sisi + 1... sj. For example, substring s[2...4] of string s = "abacaba" equals "bac".

Input

The first line of input contains a non-empty string s which consists of lowercase letters ('a'...'z'), s contains at most 2000 characters.

Output

Output a single number — the quantity of pairs of non-overlapping palindromic substrings of s.

Please do not use the %lld format specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d format specifier.

Examples

Input

aa


Output

1


Input

aaa


Output

5


Input

abacaba


Output

36

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int beg[3 * 2000 + 10] = {0}, en[3 * 2000 + 10] = {0};
char s_[3 * 2000 + 10], s[3 * 2000 + 10];
void strans(char *s, char *t) {
  int i, p = 0;
  t[p++] = '$';
  for (i = 0; s[i] != '\0'; i++) {
    t[p++] = s[i];
    t[p++] = '$';
  }
  t[p] = '\0';
}
void disp(int *A, int n) {
  int i;
  for (i = 0; i < n; i++) printf("%d ", A[i]);
  printf("\n");
}
int main() {
  scanf("%s", s_);
  strans(s_, s);
  int lx = strlen(s), i;
  for (i = 0; i < lx; i++) {
    int x = 0;
    while (i - x >= 0 && i + x < lx && s[i - x] == s[i + x]) {
      beg[i - x]++;
      en[i + x]++;
      x++;
    }
  }
  long long ans = 0;
  for (i = lx - 2; i >= 0; i -= 2) {
    beg[i] = beg[i] + beg[i + 2];
  }
  for (i = 2; i < lx; i += 2) {
    ans += ((long long)en[i - 1]) * beg[i + 1];
  }
  printf("%I64d\n", ans);
  return 0;
}