
"""simple docstring"""







def 			A_			(					lowercase = 1000      )     ->							int:


     """simple docstring"""







     return sum(i for i in range(lowercase      ) if i % 3 == 0 or i % 5 == 0      )


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



"""simple docstring"""







from __future__ import annotations



class 		UpperCAmelCase_	:
 """simple docstring"""




 def __init__( self       : Any     ,   a_       : int = 0 )->					None:



      """simple docstring"""

      UpperCAmelCase_						:    Tuple    					=  value
      UpperCAmelCase_						:    Node | None    					=  None
      UpperCAmelCase_						:    Node | None    					=  None




def 			A_			(					lowercase						, lowercase      )     ->							Node | None:


     """simple docstring"""







     if treea is None:
          return treea
     if treea is None:
          return treea

     UpperCAmelCase_						:    int    					=  treea.value + treea.value
     UpperCAmelCase_						:    List[str]    					=  merge_two_binary_trees(treea.left						, treea.left      )
     UpperCAmelCase_						:    List[str]    					=  merge_two_binary_trees(treea.right						, treea.right      )
     return treea




def 			A_			(					lowercase      )     ->							None:


     """simple docstring"""







     if root:
          print(root.value      )
          print_preorder(root.left      )
          print_preorder(root.right      )


if __name__ == "__main__":
       lowercase_						    =					Node(1)
       lowercase_						    =					Node(2)
       lowercase_						    =					Node(3)
       lowercase_						    =					Node(4)

       lowercase_						    =					Node(2)
       lowercase_						    =					Node(4)
       lowercase_						    =					Node(6)
       lowercase_						    =					Node(9)
       lowercase_						    =					Node(5)

       print("Tree1 is: ")
       print_preorder(treea)
       print("Tree2 is: ")
       print_preorder(treea)
       lowercase_						    =					merge_two_binary_trees(treea, treea)
       print("Merged Tree is: ")
       print_preorder(merged_tree)

