import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

memo = defaultdict(int)
s = input()
sn = len(s)
count = 0
def solve(a,b):
  global count
  if a == "":
    if not memo[b]:
      count += 1
      memo[b] = True
    return
  l = len(a)
  if l > 1:
    solve(s[1:l], b + a[0])
    solve(s[0:l - 1], b + a[l - 1])
  else:
    solve("", b + a)
solve(s, "")
print(count)