
'''simple docstring'''




from __future__ import annotations

from cmath import sqrt







def 		lowerCAmelCase_				(   snake_case__		,				snake_case__		,				snake_case__						):




    '''simple docstring'''



    if a == 0:
        raise ValueError('''Coefficient \'a\' must not be zero.'''						)
    A       :   List[str]					=						b * b - 4 * a * c

    A       :   Optional[Any]					=						(-b + sqrt(snake_case__						)) / (2 * a)
    A       :   int					=						(-b - sqrt(snake_case__						)) / (2 * a)

    return (
        root_a.real if not root_a.imag else root_a,
        root_a.real if not root_a.imag else root_a,
    )







def 		lowerCAmelCase_				(   ):




    '''simple docstring'''



    A,  A       :   int					=						quadratic_roots(a=5		,				b=6		,				c=1						)
    print(F'The solutions are: {solutiona} and {solutiona}'						)


if __name__ == "__main__":
      main()










'''simple docstring'''

from collections import defaultdict


def 		__magic_name__    (	__UpperCAmelCase	)		->					int:

					'''simple docstring'''

					snake_case_									=				1
					snake_case_									=				True
					for v in tree[start]:
										if v not in visited:
															ret += dfs(__UpperCAmelCase	)
					if ret % 2 == 0:
										cuts.append(__UpperCAmelCase	)
					return ret


def 		__magic_name__    (	)		->					Union[str, Any]:

					'''simple docstring'''

					dfs(1	)


if __name__ == "__main__":
							a		,a  :				Dict									=  10, 9
							a  :				Dict									=  defaultdict(list)
							a  :				dict[int, bool]									=  {}
							a  :				list[int]									=  []
							a  :				Tuple									=  0
							a  :				str									=  [(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (10, 8)]
							for u, v in edges:
														tree[u].append(v)
														tree[v].append(u)
							even_tree()
							print(len(cuts) - 1)

