from collections import defaultdict
def  snake_case						(__lowercase						)	->	int:

      '''simple docstring'''



      _snake_case						:					Tuple    =   1
      _snake_case						:					List[Any]    =   True
      for v in tree[start]:
            if v not in visited:
                  ret += dfs(_UpperCAmelCase						)
      if ret % 2 == 0:
            cuts.append(_UpperCAmelCase						)
      return ret
def  snake_case						()	->	Any:

      '''simple docstring'''



      dfs(1						)


if __name__ == "__main__":
    __SCREAMING_SNAKE_CASE						:   Any         =			1_0, 9
    __SCREAMING_SNAKE_CASE						:   Any         =			defaultdict(list)
    __SCREAMING_SNAKE_CASE						:   dict[int, bool]         =			{}
    __SCREAMING_SNAKE_CASE						:   list[int]         =			[]
    __SCREAMING_SNAKE_CASE						:   str         =			0
    __SCREAMING_SNAKE_CASE						:   List[Any]         =			[(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (1_0, 8)]
    for u, v in edges:
        tree[u].append(v)
        tree[v].append(u)
    even_tree()
    print(len(cuts) - 1)
from __future__ import annotations
def  snake_case						(__lowercase ,      __lowercase						)	->	float:

						'''simple docstring'''



						_snake_case						:					Any    =   sorted(numsa + numsa						)
						_snake_case    ,_snake_case						:					Any    =   divmod(len(__lowercase						) ,      2						)
						if mod == 1:
												return all_numbers[div]
						else:
												return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				__SCREAMING_SNAKE_CASE						:   Union[str, Any]         =			[float(x) for x in input('Enter the elements of first array: ').split()]
				__SCREAMING_SNAKE_CASE						:   List[Any]         =			[float(x) for x in input('Enter the elements of second array: ').split()]
				print(F'''The median of two arrays is: {median_of_two_arrays(array_a, array_a)}''')