procedure a(var c:Arr;i,j:word);
var
    m,k:word;
begin
    for k:=j-i+1 downto 1 do
       for m:=1 to (j-i+1)-k+1 do
          if testpalindrom(c,i+m-1,i+m-1+k-1) then
             begin
                a(c,i,i+m-2);
                writestr(c,i+m-1,i+m-1+k-1);
                a(c,i+m-1+k,j);
                exit;
             end;
end;

var a:array[0..30,0..30] of longint;
     i,j,n,x,y:longint;
     s:string;
     f,f1:text;
begin
assign(f,'palindrome1.dat'); reset(f);
assign(f1,'palindrome2.sol'); rewrite(f1);
  readln(f,s);
  n:=length(s);
  for i:=1 to n do
   a[i,i]:=1;

  for j:=2 to n do
   for i:=1 to n-j+1 do
    if(s[i]=s[i+j-1]) then a[i+j-1,i]:=a[i+j-2,i]+a[i+j-1,i+1]+1
    else a[i+j-1,i]:=a[i+j-2,i]+a[i+j-1,i+1]-a[i+j-2,i+1];
  writeln(f1,a[n,1]);
  close(f);
  close(f1);
end.