




def 		lowercase__ (		__A:						int				,__A:						list					):





					'''simple docstring'''






					__magic_name__				:						Union[str, Any]     				=				sorted(__A				,key=lambda __A					: value[2]				,reverse=__A					)

					# Create a list of size equal to the maximum deadline
					# and initialize it with -1
					__magic_name__				:						Dict     				=				max(__A				,key=lambda __A					: value[1]					)[1]
					__magic_name__				:						List[str]     				=				[-1] * max_deadline

					# Finding the maximum profit and the count of jobs
					__magic_name__				:						Optional[Any]     				=				0
					__magic_name__				:						str     				=				0
					for job in jobs:
										# Find a free time slot for this job
										# (Note that we start from the last possible slot)
										for i in range(job[1] - 1				,-1				,-1					):
															if time_slots[i] == -1:
																				__magic_name__				:						str     				=				job[0]
																				count += 1
																				max_profit += job[2]
																				break
					return [count, max_profit]


if __name__ == "__main__":
	import doctest

	doctest.testmod()









def 		lowercase__ (		__A:						int					):





					'''simple docstring'''






					if not isinstance(__A				,__A					):
										__magic_name__				:						Dict     				=				F'''Input value of [number={number}] must be an integer'''
										raise TypeError(__A					)
					if number < 0 or number % 2 == 1:
										return False
					__magic_name__				:						Any     				=				int(number**0.5					)
					return number == number_sqrt * (number_sqrt + 1)


if __name__ == "__main__":
	import doctest

	doctest.testmod()



