def  _lowerCamelCase					(   a_				: int = 1_00):
			lowerCamelCase						:int						  =     set()

			lowerCamelCase						:Dict						  =     0

			lowerCamelCase						:Union[str, Any]						  =     n + 1  # maximum limit

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


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




def  _lowerCamelCase					(   a_				: str						,			a_				: str):
			lowerCamelCase						:List[str]						  =     len(a_)
			lowerCamelCase						:List[str]						  =     len(a_)
			lowerCamelCase						:int						  =     [[False for _ in range(m + 1)] for _ in range(n + 1)]
			lowerCamelCase						:Optional[Any]						  =     True
			for i in range(a_):
						for j in range(m + 1):
									if dp[i][j]:
												if j < m and a[i].upper() == b[j]:
															lowerCamelCase						:Any						  =     True
												if a[i].islower():
															lowerCamelCase						:List[str]						  =     True
			return dp[n][m]


if __name__ == "__main__":
			import doctest

			doctest.testmod()



