





"""simple docstring"""



def 						__lowercase	(  snake_case_    :    list		)  ->float:



    '''simple docstring'''







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


if __name__ == "__main__":
       import doctest

       doctest.testmod()











"""simple docstring"""



def 						__lowercase	(  snake_case_    :    int							,snake_case_    :    int		)  ->int:



    '''simple docstring'''







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







def 						__lowercase	(  )  ->None:



    '''simple docstring'''







    assert and_gate(0							,0		) == 0
    assert and_gate(0							,1		) == 0
    assert and_gate(1							,0		) == 0
    assert and_gate(1							,1		) == 1


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




