






def 					lowercase_ (    __snake_case     :							Optional[Any]      ):





				'''simple docstring'''


				snake_case__      :Optional[int]         =   [False] * len(UpperCAmelCase__      )
				snake_case__      :Union[str, Any]         =   [-1] * len(UpperCAmelCase__      )

				def dfs(__snake_case     :							str	,	__snake_case     :							Optional[Any]      ):
								snake_case__      :List[str]         =   True
								snake_case__      :str         =   c
								for u in graph[v]:
												if not visited[u]:
																dfs(UpperCAmelCase__	,	1 - c      )

				for i in range(len(UpperCAmelCase__      )      ):
								if not visited[i]:
												dfs(UpperCAmelCase__	,	0      )

				for i in range(len(UpperCAmelCase__      )      ):
								for j in graph[i]:
												if color[i] == color[j]:
																return False

				return True


# Adjacency list of graph
__UpperCAmelCase							:   List[str]							=  {0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 4: []}
print(check_bipartite_dfs(graph))







def 					lowercase_ (    __snake_case     :							int = 10_00      )     -> int:





				'''simple docstring'''


				snake_case__      :int         =   3
				snake_case__      :int         =   0
				while a < n:
								if a % 3 == 0 or a % 5 == 0:
												result += a
								elif a % 15 == 0:
												result -= a
								a += 1
				return result


if __name__ == "__main__":
	print(F'''{solution() = }''')