






from __future__ import annotations






class 					a						:






    def __init__(	self					:							Optional[int]	,						__SCREAMING_SNAKE_CASE					:							int = 0 )					->		None:
      lowerCamelCase_   					=						value
      lowerCamelCase_   					=						None
      lowerCamelCase_   					=						None







def 					lowerCamelCase__	(							_lowerCamelCase	:		Node | None		,    _lowerCamelCase	:		Node | None			)				->    Tuple:
  if treea is None:
    return treea
  if treea is None:
    return treea

  lowerCamelCase_   					=						treea.value + treea.value
  lowerCamelCase_   					=						merge_two_binary_trees(treea.left		,    treea.left			)
  lowerCamelCase_   					=						merge_two_binary_trees(treea.right		,    treea.right			)
  return treea







def 					lowerCamelCase__	(							_lowerCamelCase	:		Node | None			)				->    Optional[int]:
  if root:
    print(root.value			)
    print_preorder(root.left			)
    print_preorder(root.right			)


if __name__ == "__main__":
  _SCREAMING_SNAKE_CASE :    Union[str, Any]    =						Node(1)
  _SCREAMING_SNAKE_CASE :    int    =						Node(2)
  _SCREAMING_SNAKE_CASE :    str    =						Node(3)
  _SCREAMING_SNAKE_CASE :    Any    =						Node(4)

  _SCREAMING_SNAKE_CASE :    List[str]    =						Node(2)
  _SCREAMING_SNAKE_CASE :    Union[str, Any]    =						Node(4)
  _SCREAMING_SNAKE_CASE :    Optional[int]    =						Node(6)
  _SCREAMING_SNAKE_CASE :    List[Any]    =						Node(9)
  _SCREAMING_SNAKE_CASE :    Any    =						Node(5)

  print('''Tree1 is: ''')
  print_preorder(treea)
  print('''Tree2 is: ''')
  print_preorder(treea)
  _SCREAMING_SNAKE_CASE :    Dict    =						merge_two_binary_trees(treea, treea)
  print('''Merged Tree is: ''')
  print_preorder(merged_tree)












"""simple docstring"""





def 					lowerCamelCase__	(							_lowerCamelCase	:		int = 1000			)				->    int:
  lowerCamelCase_   					=						0
  lowerCamelCase_   					=						(n - 1) // 3
  total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  lowerCamelCase_   					=						(n - 1) // 5
  total += ((terms) * (10 + (terms - 1) * 5)) // 2
  lowerCamelCase_   					=						(n - 1) // 15
  total -= ((terms) * (30 + (terms - 1) * 15)) // 2
  return total


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




