#!/usr/bin/python
# -*- coding: utf-8 -*-

S = list(raw_input())
L = len(S)

strings = set([])
def dfs(S, string, n):
    if n == L:
        strings.add(string)
        return False

    if dfs(S[1:], string+S[0], n+1):
        return
    if dfs(S[:-1], string+S[-1], n+1):
        return

dfs(S, '', 0)
print len(strings)