#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;

string s;
int mod[2] = {1000003577, 1000003601};
ll rh[5000][5000], cnt[5000], ans;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> s;
  int l = sz(s);
  ll a[2];
  FOR(i, 0, l){
    a[0] = 0;
    a[1] = 0;
    FOR(j, i, l){
      FOR(k, 0, 2)a[k] = (a[k] * 26 + (s[j] - '0')) % mod[k];
      rh[i][j] = a[0] * mod[1] + a[1];
    }
    a[0] = 0;
    a[1] = 0;
    FORR(j, i, 0){
      FOR(k, 0, 2)a[k] = (a[k] * 26 + (s[j] - '0')) % mod[k];
      rh[i][j] = a[0] * mod[1] + a[1];
    }
  }
  FOR(i, 0, l-3){
    if(rh[0][i] != rh[i][0])continue;
    FOR(j, i+1, l-2)if(rh[i+1][j] == rh[j][i+1])cnt[j]++;
  }
  FOR(i, 3, l){
    if(rh[i][l-1] != rh[l-1][i])continue;
    FOR(j, 1, i-1) ans += cnt[j];
  }
  cout << ans << endl;
  return 0;
}