import algorithm, sets, sequtils, strutils

let
  s = stdin.readLine
  x = s.toSeq
  y = x.reversed
var
  list =  newSeq[(string, int, int)]().repeat s.len.succ

list[0].add @[("", 0, 0)]

for i in 0 .. s.high:
  for (str, cntX, cntY) in list[i]:
    list[i.succ].add (str & x[cntX], cntX.succ, cntY)
    list[i.succ].add (str & y[cntY], cntX, cntY.succ)

let
  ans = list[^1].mapIt(it[0]).toHashSet.len

echo ans