




def 		snake_case_   (UpperCamelCase	:  int = 100				):





							'''simple docstring'''


							_a     					=    set()

							_a     					=    0

							_a     					=    n + 1  # maximum limit

							for a in range(2			,						lowerCAmelCase__				):
														for b in range(2			,						lowerCAmelCase__				):
																					_a     					=    a**b  # calculates the current power
																					collect_powers.add(lowerCAmelCase__				)  # adds the result to the set
							return len(lowerCAmelCase__				)


if __name__ == "__main__":
				print('Number of terms ', solution(int(str(input()).strip())))







'''simple docstring'''


from __future__ import annotations
def 		snake_case_   (UpperCamelCase	:  list[int]				):





							'''simple docstring'''


							if not nums:
														return 0
							_a     					=    nums[0]
							_a     					=    0
							for num in nums[1:]:
														_a					,							_a     					=    (
														    max_excluding + num,
														    max(UpperCamelCase			,						UpperCamelCase				),
														)
							return max(UpperCamelCase			,						UpperCamelCase				)


if __name__ == "__main__":
				import doctest

				doctest.testmod()

