




def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       list     ):


      '''simple docstring'''



      lowerCamelCase_		     =    0
      while len(lowercase     ) > 1:
            lowerCamelCase_		     =    0
            # Consider two files with minimum cost to be merged
            for _ in range(2     ):
                  lowerCamelCase_		     =    files.index(min(lowercase     )     )
                  temp += files[min_index]
                  files.pop(lowercase     )
            files.append(lowercase     )
            optimal_merge_cost += temp
      return optimal_merge_cost


if __name__ == "__main__":
 import doctest

 doctest.testmod()









def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       int	,							lowercase	:       int     ):


      '''simple docstring'''



      return int((input_a, input_a).count(1     ) != 0     )

def 			_SCREAMING_SNAKE_CASE			(							):


      '''simple docstring'''



      assert or_gate(0	,							0     ) == 0
      assert or_gate(0	,							1     ) == 1
      assert or_gate(1	,							0     ) == 1
      assert or_gate(1	,							1     ) == 1


if __name__ == "__main__":
 print(or_gate(0, 1))
 print(or_gate(1, 0))
 print(or_gate(0, 0))
 print(or_gate(1, 1))



