UVa 353

#include <bits/stdc++.h>
// #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <algorithm>
// #include <cmath>
// #include <vector>
// #include <set>
// #include <map>
// #include <queue>
// #include <ctime>
// #include <cassert>
// #include <complex>
// #include <string>
// #include <cstring>
// #include <queue>
// #include <bitset>

using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")


#define ll              long long int
#define vi              vector< int >
#define vll             vector< ll >

#define sc              scanf
#define pf              printf
#define cspf(i)         pf("Case %d: ", i)
#define spc             pf(" ")
#define line            pf("\n")

#define ff              first
#define ss              second
#define mp              make_pair
#define pb              push_back
#define tp(v,j)         get<j>(v)
#define Log(b,x)        (log(x)/log(b))

#define FOR(i,x,y)      for(int i = int(x); i < int(y); i++)
#define ROF(i,x,y)      for(int i = int(x)-1; i >= int(y); i--)
#define clr(arr,x)      memset(arr, x, sizeof arr)
#define vout(v,sz)      for(int w=0;w<sz;w++){if(w) spc; cout<<v[w];}
#define all(v)          v.begin(), v.end()
#define rall(v)         v.rbegin(), v.rend()
#define unq(v)          sort(all(v)),(v).resize(unique(all(v))-v.begin())
#define fastIO          ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)

#define sc1(x)          sc("%d",&x);
#define sc2(x,y)        sc("%d %d", &x, &y)
#define sc3(x,y,z)      sc("%d %d %d", &x, &y, &z)
#define scl1(x)         sc("%lld",&x);
#define scl2(x,y)       sc("%lld %lld", &x, &y)
#define scf1(x)         sc("%lf",&x);
#define scf2(x,y)       sc("%lf %lf", &x, &y)

#define pf1(x)          pf("%d",x);
#define pf2(x,y)        pf("%d %d", x, y)
#define pfl1(x)         pf("%lld",x);

#define MOD             (int)(998244353)
#define MaxN            100000
#define inf             0x3f3f3f3f
#define PI              acos(-1.0)  // 3.1415926535897932
#define eps             1e-9

template <class T> inline T bigMod(T p,T e,T M){T ret=1; for(;e>0;e>>=1){ if(e&1) ret=(ret*p)%M; p=(p*p)%M;} return (T)ret;}
template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}

/*By Arg_007*/
struct FindHash{
    int b1 = 129, b2 = 371 ;
    vector <int> bp1 , bp2 ;
    vector <int> h1 , h2 ;
    string s ;
    int sz ;

    ll mod1 = 998244353LL , mod2 = 1000000009LL ;

    void init( string _s)
    {
        bp1.clear() ;
        bp2.clear() ;
        h1.clear() ; h2.clear() ;

        s = _s ;
        sz = s.size() ;

        bp1.pb(1) ; bp2.pb(1) ;

        for(int i=1 ; i < sz+2 ; i++)
        {
            bp1.pb( (1LL*bp1.back()*b1)%mod1 ) ;
            bp2.pb( (1LL*bp2.back()*b2)%mod2 ) ;
        }

        h1.pb(s[0]-'a' + 1) ; h2.pb(s[0]-'a' + 1) ;

        for(int i=1 ; i<sz ; i++)
        {
            h1.pb( (1LL*h1.back()*b1 + s[i]-'a' + 1) % mod1 ) ;
            h2.pb( (1LL*h2.back()*b2 + s[i]-'a' + 1) % mod2 ) ;
        }
    }

    pair<int,int> Get(int i, int j)
    {
        pair<int,int> res = mp( h1[j],h2[j] ) ;
        if(i>0) res=mp((res.ff-1LL*h1[i-1]*bp1[j-i+1])%mod1,(res.ss-1LL*h2[i-1]*bp2[j-i+1])%mod2);
        res = mp((res.ff%mod1+mod1)%mod1,(res.ss%mod2+mod2)%mod2);
        return res ;
    }

}f1, f2;

// inline bool isPal(int l,int r,int n) {return f1.Get(l, r)==f2.Get(n-r-1, n-l-1);}

map< pair< int, int >, bool > cnt;

int main()
{
    #ifndef ONLINE_JUDGE
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    string s;
    while(cin >> s){
        cnt.clear();

        cout << "The string '" << s << "' contains ";

        f1.init(s);
        reverse(all(s));
        f2.init(s);

        int n = s.size();
        int c = 0;

        for(int i=0; i<n; i++){
            for(int j=i; j<n; j++){
                pair< int, int > p1, p2;
                p1 = f1.Get(i, j);
                p2 = f2.Get(n-j-1, n-i-1);

                if(p1 == p2 && !cnt[p1]){
                    cnt[p1] = true;
                    c++;
                }
            }
        }
        cout << c << " palindromes.\n";
    }


    #ifndef ONLINE_JUDGE
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}