



"""simple docstring"""

def    __snake_case       (  __A			:	int       ,		__A			:	list    )    ->					list:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE	:       List[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
				SCREAMING_SNAKE_CASE	:       List[Any] 							=    max(__A       ,		key=lambda __A    : value[1]    )[1]
				SCREAMING_SNAKE_CASE	:       int 							=    [-1] * max_deadline

				# Finding the maximum profit and the count of jobs
				SCREAMING_SNAKE_CASE	:       Any 							=    0
				SCREAMING_SNAKE_CASE	:       Any 							=    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:
																SCREAMING_SNAKE_CASE	:       Any 							=    job[0]
																count += 1
																max_profit += job[2]
																break
				return [count, max_profit]


if __name__ == "__main__":
							import doctest

							doctest.testmod()










"""simple docstring"""

def    __snake_case       (  __A			:	int = 100    )    ->					int:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE	:       Any 							=    1
				SCREAMING_SNAKE_CASE	:       Optional[int] 							=    0
				for i in range(1       ,		num + 1    ):
								fact *= i

				for j in str(__A    ):
								result += int(__A    )

				return result


if __name__ == "__main__":
							print(solution(int(input('Enter the Number: ').strip())))





