



"""simple docstring"""

A_	:						Tuple				=   {0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

A_	:						List[str]				=   {0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}
def    __snake_case       (  __A			:	dict       ,		__A			:	int       ,		__A			:	list    )    ->					list:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE	:       List[str] 							=    True
				SCREAMING_SNAKE_CASE	:       Tuple 							=    []

				for neighbour in graph[vert]:
								if not visited[neighbour]:
												connected_verts += dfs(__A       ,		__A       ,		__A    )

				return [vert, *connected_verts]
def    __snake_case       (  __A			:	dict    )    ->					list:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE	:       Tuple 							=    len(__A    )
				SCREAMING_SNAKE_CASE	:       Dict 							=    graph_size * [False]
				SCREAMING_SNAKE_CASE	:       Union[str, Any] 							=    []

				for i in range(__A    ):
								if not visited[i]:
												SCREAMING_SNAKE_CASE	:       Optional[int] 							=    dfs(__A       ,		__A       ,		__A    )
												components_list.append(__A    )

				return components_list


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())))





