



UpperCAmelCase_		 =					[
    (1_0_0_0, """M"""),
    (9_0_0, """CM"""),
    (5_0_0, """D"""),
    (4_0_0, """CD"""),
    (1_0_0, """C"""),
    (9_0, """XC"""),
    (5_0, """L"""),
    (4_0, """XL"""),
    (1_0, """X"""),
    (9, """IX"""),
    (5, """V"""),
    (4, """IV"""),
    (1, """I"""),
]

def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:str				)  ->     int:
   _A      =       {'''I''': 1, '''V''': 5, '''X''': 10, '''L''': 50, '''C''': 100, '''D''': 500, '''M''': 1_000}
   _A      =       0
   _A      =       0
   while place < len(_snake_case				):
      if (place + 1 < len(_snake_case				)) and (vals[roman[place]] < vals[roman[place + 1]]):
         total += vals[roman[place + 1]] - vals[roman[place]]
         place += 2
      else:
         total += vals[roman[place]]
         place += 1
   return total

def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:int				)  ->     str:
   _A      =       []
   for arabic, roman in ROMAN:
      ((_A)  ,    (_A))      =       divmod(_snake_case	,   _snake_case				)
      result.append(roman * factor				)
      if number == 0:
         break
   return "".join(_snake_case				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()







def       _lowerCAmelCase    (				lowerCAmelCase_				:int		,    lowerCAmelCase_				:int				)->int:
   '''simple docstring'''






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



def       _lowerCAmelCase    (				)->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))




