





'''simple docstring'''



from __future__ import annotations

import string
from itertools import cycle, product
from pathlib import Path

_SCREAMING_SNAKE_CASE   =      (
    string.ascii_letters + string.digits + string.punctuation + string.whitespace
)
_SCREAMING_SNAKE_CASE   =      [ord(letter) for letter in string.ascii_lowercase]
_SCREAMING_SNAKE_CASE   =      {ord(char) for char in VALID_CHARS}

_SCREAMING_SNAKE_CASE   =      ["the", "be", "to", "of", "and", "in", "that", "have"]




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[int]						,    lowerCamelCase_     :					tuple[int, ...]			):
			__lowercase			  =							""
			__lowercase			  =							42
			__lowercase			  =							42
			__lowercase			  =							42

			for keychar, cipherchar in zip(cycle(lowerCamelCase_			)						,    lowerCamelCase_			):
						__lowercase			  =							cipherchar ^ keychar
						if decodedchar not in VALID_INTS:
									return None
						decoded += chr(lowerCamelCase_			)

			return decoded




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[int]			):
			__lowercase			  =							[]
			for key in product(lowerCamelCase_						,    repeat=3			):
						__lowercase			  =							try_key(lowerCamelCase_						,    lowerCamelCase_			)
						if encoded is not None:
									possibles.append(lowerCamelCase_			)
			return possibles




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[str]						,    lowerCamelCase_     :					str			):
			return [possible for possible in possibles if common_word in possible.lower()]




def 				_lowerCAmelCase  (			lowerCamelCase_     :					str = "p059_cipher.txt"			):
			__lowercase			  =							42
			__lowercase			  =							42
			__lowercase			  =							42
			__lowercase			  =							42
			__lowercase			  =							Path(lowerCamelCase_			).parent.joinpath(lowerCamelCase_			).read_text(encoding='''utf-8'''			)

			__lowercase			  =							[int(lowerCamelCase_			) for number in data.strip().split(''','''			)]

			__lowercase			  =							filter_valid_chars(lowerCamelCase_			)
			for common_word in COMMON_WORDS:
						__lowercase			  =							filter_common_word(lowerCamelCase_						,    lowerCamelCase_			)
						if len(lowerCamelCase_			) == 1:
									break

			__lowercase			  =							possibles[0]
			return sum(ord(lowerCamelCase_			) for char in decoded_text			)


if __name__ == "__main__":
	print(f'''{solution() = }''')












'''simple docstring'''



from math import sqrt




def 				_lowerCAmelCase  (			lowerCamelCase_     :					int			):
			__lowercase			  =							0
			for i in range(1						,    int(sqrt(lowerCamelCase_			) + 1			)			):
						if n % i == 0 and i != sqrt(lowerCamelCase_			):
									total += i + n // i
						elif i == sqrt(lowerCamelCase_			):
									total += i
			return total - n




def 				_lowerCAmelCase  (			lowerCamelCase_     :					int = 1_0_0_0_0			):
			__lowercase			  =							sum(
			    i
			    for i in range(1						,    lowerCamelCase_			)
			    if sum_of_divisors(sum_of_divisors(lowerCamelCase_			)			) == i and sum_of_divisors(lowerCamelCase_			) != i			)
			return total


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





