#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int width,height;
int m,n;

string str;

bool is_kaibun(int left,int right){
    while (left<right){
        if (str[left]!=str[right]){
            return false;
        }
        left++;right--;
    }
    return true;
}

int dfs(int idx = 0,int stage = 0,int left = 0){
    static map<int,int> memo;
    
    if (idx == n-1) return 0;
    
    int key = idx|(left<<13)|(stage<<26);
    if (memo.count(key)) return memo[key];
    
    int result = 0;
    switch (stage){ // PPAP
        case 0:
        case 1:
            if (is_kaibun(left,idx)){
                result += dfs(idx+1,stage+1,idx+1);
            }
            result += dfs(idx+1,stage,left);
            break;
        case 2:
            return 0;
            if (is_kaibun(idx+1,n-1)){
                result+=1;
            }
            result += dfs(idx+1,stage,left);
            break;
    }
    return memo[key] = result;
}

int main(){
    int i,j,k;
    int x,y,a,b;
    
    cin >> str;
    n = str.size();
    
    cout << dfs() << endl;

    return 0;
}