

'''simple docstring'''




from __future__ import annotations

import math
from collections import Counter
from string import ascii_lowercase


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : str    ):
  UpperCAmelCase				,   UpperCAmelCase    				=						analyze_text(SCREAMING_SNAKE_CASE    )
  UpperCAmelCase    				=						list(' ' + ascii_lowercase    )
  # what is our total sum of probabilities.
  UpperCAmelCase    				=						sum(single_char_strings.values()    )

  # one length string
  UpperCAmelCase    				=						0
  # for each alpha we go in our dict and if it is in it we calculate entropy
  for ch in my_alphas:
    if ch in single_char_strings:
      UpperCAmelCase    				=						single_char_strings[ch]
      UpperCAmelCase    				=						my_str / all_sum
      my_fir_sum += prob * math.loga(SCREAMING_SNAKE_CASE    )  # entropy formula.

    # print entropy
  print(f'''{round(-1 * my_fir_sum    ):.1f}'''    )

  # two len string
  UpperCAmelCase    				=						sum(two_char_strings.values()    )
  UpperCAmelCase    				=						0
  # for each alpha (two in size) calculate entropy.
  for cha in my_alphas:
    for cha in my_alphas:
      UpperCAmelCase    				=						cha + cha
      if sequence in two_char_strings:
        UpperCAmelCase    				=						two_char_strings[sequence]
        UpperCAmelCase    				=						int(SCREAMING_SNAKE_CASE    ) / all_sum
        my_sec_sum += prob * math.loga(SCREAMING_SNAKE_CASE    )

    # print second entropy
  print(f'''{round(-1 * my_sec_sum    ):.1f}'''    )

  # print the difference between them
  print(f'''{round((-1 * my_sec_sum) - (-1 * my_fir_sum)    ):.1f}'''    )


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : str    ):
  UpperCAmelCase    				=						Counter()  # type: ignore
  UpperCAmelCase    				=						Counter()  # type: ignore
  single_char_strings[text[-1]] += 1

  # first case when we have space at start.
  two_char_strings[" " + text[0]] += 1
  for i in range(0							, len(SCREAMING_SNAKE_CASE    ) - 1    ):
    single_char_strings[text[i]] += 1
    two_char_strings[text[i : i + 2]] += 1
  return single_char_strings, two_char_strings


def    lowerCamelCase__		(    ):
  import doctest

  doctest.testmod()
  # text = (
  #     "Had repulsive dashwoods suspicion sincerity but advantage now him. Remark "
  #     "easily garret nor nay. Civil those mrs enjoy shy fat merry. You greatest "
  #     "jointure saw horrible. He private he on be imagine suppose. Fertile "
  #     "beloved evident through no service elderly is. Blind there if every no so "
  #     "at. Own neglected you preferred way sincerity delivered his attempted. To "
  #     "of message cottage windows do besides against uncivil.  Delightful "
  #     "unreserved impossible few estimating men favourable see entreaties. She "
  #     "propriety immediate was improving. He or entrance humoured likewise "
  #     "moderate. Much nor game son say feel. Fat make met can must form into "
  #     "gate. Me we offending prevailed discovery. "
  # )

  # calculate_prob(text)


if __name__ == "__main__":
  main()





'''simple docstring'''




from __future__ import annotations


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : int | str    ):
  UpperCAmelCase    				=						str(SCREAMING_SNAKE_CASE    )
  return n == n[::-1]


def    lowerCamelCase__		(    SCREAMING_SNAKE_CASE   : int = 100_0000    ):
  UpperCAmelCase    				=						0

  for i in range(1							, SCREAMING_SNAKE_CASE    ):
    if is_palindrome(SCREAMING_SNAKE_CASE    ) and is_palindrome(bin(SCREAMING_SNAKE_CASE    ).split('b'    )[1]    ):
      total += i
  return total


if __name__ == "__main__":
  print(solution(int(str(input().strip()))))


