#include <iostream>     // Input/output stream objects
#include <fstream>      // File stream objects
#include <sstream>      // String stream objects
#include <iomanip>      // Input/output manipulators
#include <string>       // String class and functions
#include <vector>       // Dynamic array
#include <list>         // Doubly linked list
#include <set>          // Set container
#include <map>          // Map container
#include <queue>        // Queue container
#include <stack>        // Stack container
#include <algorithm>    // Algorithms on sequences (e.g., sort, find)
#include <cmath>        // Mathematical functions
#include <climits>      // LLONG_MAX, LLONG_MIN
#include <ctime>        // Date and time functions
#include <cstdlib>      // General purpose functions (e.g., memory management)
#include <cstring>      // C-style string functions
#include <cctype>       // Character classification functions
#include <cassert>      // Assert function for debugging
#include <exception>    // Standard exceptions
#include <functional>   // Function objects
#include <iterator>     // Iterator classes
#include <limits>       // Numeric limits
#include <locale>       // Localization and internationalization
#include <numeric>      // Numeric operations (e.g., accumulate)
#include <random>       // Random number generators
#include <stdexcept>    // Standard exception classes
#include <typeinfo>     // Runtime type information
#include <utility>      // Utility components (e.g., std::pair)
#include <bitset>

using namespace std;

#define FOR(i, a, b) for(int i = a; i < (b); i++)
#define FORE(i, a, b) for(int i = a; i <= (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define x first 
#define y second
#define mp make_pair
#define PI 3.141592653
#define compress(coord) sort(all(coord)), coord.resize(unique(all(coord)) - coord.begin())
const double eps = 1e-9; // x < eps (x <= 0) x < -eps (x < 0)
const ll inf = LLONG_MAX;

const int N = 810;
const ll base = 137, mod = 1e9 + 7;
vector<ll> basepow(N), baseinv(N), sumh(N);
string S;
int n;

ll mul(ll a, ll b) { return (a * b) % mod; }
ll add(ll a, ll b) { return (a + b) % mod; }
ll sub(ll a, ll b) { return (a - b + mod) % mod; }


ll calpow(ll a, ll b) {
    ll ret = 1;
    for (; b; b >>= 1) {
        if (b & 1) ret = mul(ret, a);
        a = mul(a, a);
    }
    return ret;
}

ll calhash(int l, int r) {
    if (l < 1 || r > n) return -1;
    return mul(sub(sumh[r], sumh[l-1]), baseinv[l]);
}

pair<ll, ll> solve(string s) {
    FORE (i, 1, n+10) sumh[i] = 0;
    FORE (i, 1, n) sumh[i] = sumh[i-1] + (basepow[i] * (s[i-1] - 'a'));

    ll ans = 0, sym = 0;
    FORE (i, 1, n) {
        FORE (j, i, n) {
            ll curhash = calhash(i, j);
            ll cnt = 0;
            if (curhash == calhash(j+1, 2*j-i+1)) sym++;
            FORE (k, j+1, n) {
                ll csym = calhash(k+1, k+j-i+1);
                ll prevh = calhash(i-k+j, i-1);
                ll nexth = calhash(j+1, k);

                if (prevh == nexth) cnt++;
                if (curhash == csym) {
                    // cout << i << " " << j << " " << k << endl;
                    sym++, ans += cnt;
                }
            }
        }
    }
    return mp(ans, sym);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

    basepow[0] = 1, baseinv[0] = 1;
    FORE (i, 1, 800) basepow[i] = mul(basepow[i-1], base);
    baseinv[1] = calpow(base, mod-2);
    FORE (i, 2, 800) baseinv[i] = mul(baseinv[i-1], baseinv[1]);


    cin >> S;
    n = (int)S.length();
    pair<ll, ll> ans1 = solve(S);
    reverse(all(S));
    pair<ll, ll> ans2 = solve(S);
    // cout << ans1.x << " " << ans1.y << endl;
    // cout << ans2.x << " " << ans2.y << endl;
    cout << ans1.x + ans2.x + ans1.y <<endl;
    return 0;
}