



_UpperCAmelCase     =			{}





def      __magic_name__				(							lowercase							,			lowercase							,			lowercase ):

   # if we are absent twice, or late 3 consecutive days,
   # no further prize strings are possible
   if late == 3 or absent == 2:
      return 0

   # if we have no days left, and have not failed any other rules,
   # we have a prize string
   if days == 0:
      return 1

   # No easy solution, so now we need to do the recursive calculation

   # First, check if the combination is already in the cache, and
   # if yes, return the stored value from there since we already
   # know the number of possible prize strings from this point on
   SCREAMING_SNAKE_CASE_: Optional[int]     			=(days, absent, late)
   if key in cache:
      return cache[key]

   # now we calculate the three possible ways that can unfold from
   # this point on, depending on our attendance today

   # 1) if we are late (but not absent), the "absent" counter stays as
   # it is, but the "late" counter increases by one
   SCREAMING_SNAKE_CASE_: int     			=_calculate(days - 1							,			lowercase							,			late + 1 )

   # 2) if we are absent, the "absent" counter increases by 1, and the
   # "late" counter resets to 0
   SCREAMING_SNAKE_CASE_: Optional[int]     			=_calculate(days - 1							,			absent + 1							,			0 )

   # 3) if we are on time, this resets the "late" counter and keeps the
   # absent counter
   SCREAMING_SNAKE_CASE_: str     			=_calculate(days - 1							,			lowercase							,			0 )

   SCREAMING_SNAKE_CASE_: Dict     			=state_late + state_absent + state_ontime

   SCREAMING_SNAKE_CASE_: Optional[Any]     			=prizestrings
   return prizestrings





def      __magic_name__				(							lowercase = 30 ):
   return _calculate(lowercase							,			absent=0							,			late=0 )


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








"""simple docstring"""
from __future__ import annotations





def      __magic_name__				(							lowercase							,			lowercase ):
   SCREAMING_SNAKE_CASE_: List[Any]     			=sorted(numsa + numsa )
   SCREAMING_SNAKE_CASE_			,		SCREAMING_SNAKE_CASE_: Tuple     			=divmod(len(lowercase )							,			2 )
   if mod == 1:
      return all_numbers[div]
   else:
      return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   _UpperCAmelCase     =			[float(x) for x in input("""Enter the elements of first array: """).split()]
   _UpperCAmelCase     =			[float(x) for x in input("""Enter the elements of second array: """).split()]
   print(f"""The median of two arrays is: {median_of_two_arrays(array_a, array_a)}""")



