





"""simple docstring"""


from __future__ import annotations







class 	__a   :



     def __init__(       self					,     a__ = 0   ):
            _lowerCamelCase    	=					value
            _lowerCamelCase    	=					None
            _lowerCamelCase    	=					None





def SCREAMING_SNAKE_CASE_   (       snake_case   :					Node | None						,  snake_case   :					Node | None		)->		Node | None:
       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 SCREAMING_SNAKE_CASE_   (       snake_case   :					Node | None		)->		None:
       if root:
              print(root.value		)
              print_preorder(root.left		)
              print_preorder(root.right		)


if __name__ == "__main__":
      A_     :      List[Any]								=Node(1)
      A_     :      Any								=Node(2)
      A_     :      Tuple								=Node(3)
      A_     :      Optional[Any]								=Node(4)

      A_     :      Optional[int]								=Node(2)
      A_     :      List[Any]								=Node(4)
      A_     :      Any								=Node(6)
      A_     :      Any								=Node(9)
      A_     :      Tuple								=Node(5)

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













"""simple docstring"""


def SCREAMING_SNAKE_CASE_   (       )->		Tuple:
       _lowerCamelCase    	=					1

       while True:
              if (
                  sorted(str(snake_case		)		)
                  == sorted(str(2 * i		)		)
                  == sorted(str(3 * i		)		)
                  == sorted(str(4 * i		)		)
                  == sorted(str(5 * i		)		)
                  == sorted(str(6 * i		)		)
              ):
                     return i

              i += 1


if __name__ == "__main__":
      print(solution())






