#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}

ll dp[10010];

vector<string> sstr; 

void divide(string s){
  if(s=="")return ;
  for(int i=1;i<=s.size()/2;i++){
    string a = s.substr(0,i);
    string b = s.substr(s.size()-i,i);
    if(a==b){
      sstr.pb(a);
      divide(s.substr(i,s.size()-i-i));
      return;
    }
  }
  sstr.pb(s);
  sstr.pb("");
}


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  string S;
  cin >> S;

  divide(S);


  dp[0]=1;
  
  if(sstr[sstr.size()-1] == ""){
    sstr.erase(sstr.begin()+sstr.size()-1);
    

    reverse(all(sstr));
    for(ll i = 1;i<sstr.size();i++){

      for(ll j = 1; j<=i;j++){
	string a="",b="";
	for(ll k = j;k<=i;k++)
	  a+=sstr[k];
	for(ll k = i;k>=j;k--)
	  b+=sstr[k];

	if(a==b) dp[i]+=dp[i-j];
      }
      dp[i]++;
    }


  }
  else{
    reverse(all(sstr));
    
  }
  cout << dp[sstr.size()-1] << endl;
  //cout << fixed << setprecision(16) << ans << endl;
  return 0;
}