import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

S=list(readline().rstrip())
se=set()
N=len(S)
for bit in range(1<<N):
    lst=[]
    i,j=0,N-1
    for b in range(N):
        if bit>>b&1:
            lst.append(S[i])
            i+=1
        else:
            lst.append(S[j])
            j-=1
    se.add(tuple(lst))
ans=len(se)
print(ans)