import argparse
import datetime



def      __lowerCAmelCase			(					UpperCamelCase      )     ->	str:
  lowerCAmelCase__				:  Any		       =     {
      """0""": """Sunday""",
      """1""": """Monday""",
      """2""": """Tuesday""",
      """3""": """Wednesday""",
      """4""": """Thursday""",
      """5""": """Friday""",
      """6""": """Saturday""",
  }

  lowerCAmelCase__				:  Any		       =     {0: 1, 1: 2, 2: 3, 3: 4, 4: 5, 5: 6, 6: 0}

  # Validate
  if not 0 < len(UpperCamelCase__      ) < 11:
    raise ValueError('''Must be 10 characters long'''      )

  # Get month
  lowerCAmelCase__				:  int		       =     int(date_input[0] + date_input[1]      )
  # Validate
  if not 0 < m < 13:
    raise ValueError('''Month must be between 1 - 12'''      )

  lowerCAmelCase__				:  str		       =     date_input[2]
  # Validate
  if sep_a not in ["-", "/"]:
    raise ValueError('''Date separator must be \'-\' or \'/\''''      )

  # Get day
  lowerCAmelCase__				:  int		       =     int(date_input[3] + date_input[4]      )
  # Validate
  if not 0 < d < 32:
    raise ValueError('''Date must be between 1 - 31'''      )

  # Get second separator
  lowerCAmelCase__				:  str		       =     date_input[5]
  # Validate
  if sep_a not in ["-", "/"]:
    raise ValueError('''Date separator must be \'-\' or \'/\''''      )

  # Get year
  lowerCAmelCase__				:  int		       =     int(date_input[6] + date_input[7] + date_input[8] + date_input[9]      )
  # Arbitrary year range
  if not 45 < y < 8500:
    raise ValueError(
        '''Year out of range. There has to be some sort of limit...right?'''      )

  # Get datetime obj for validation
  lowerCAmelCase__				:  List[Any]		       =     datetime.date(int(UpperCamelCase__      )	,      int(UpperCamelCase__      )	,      int(UpperCamelCase__      )      )

  # Start math
  if m <= 2:
    lowerCAmelCase__				:  Optional[int]		       =     y - 1
    lowerCAmelCase__				:  int		       =     m + 12
  # maths var
  lowerCAmelCase__				:  int		       =     int(str(UpperCamelCase__      )[:2]      )
  lowerCAmelCase__				:  int		       =     int(str(UpperCamelCase__      )[2:]      )
  lowerCAmelCase__				:  int		       =     int(2.6 * m - 5.39      )
  lowerCAmelCase__				:  int		       =     int(c / 4      )
  lowerCAmelCase__				:  int		       =     int(k / 4      )
  lowerCAmelCase__				:  int		       =     int(d + k      )
  lowerCAmelCase__				:  int		       =     int(t + u + v + x      )
  lowerCAmelCase__				:  int		       =     int(z - (2 * c)      )
  lowerCAmelCase__				:  int		       =     round(w % 7      )
  # End math

  # Validate math
  if f != convert_datetime_days[dt_ck.weekday()]:
    raise AssertionError('''The date was evaluated incorrectly. Contact developer.'''      )

  # Response
  lowerCAmelCase__				:  str		       =     F"""Your date {date_input}, is a {days[str(UpperCamelCase__      )]}!"""
  return response


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     lowerCAmelCase_					    = argparse.ArgumentParser(
         description=(
             """Find out what day of the week nearly any date is or was. Enter """
             """date as a string in the mm-dd-yyyy or mm/dd/yyyy format"""
         )
     )
     parser.add_argument(
         """date_input""", type=str, help="""Date as a string (mm-dd-yyyy or mm/dd/yyyy)"""
     )
     lowerCAmelCase_					    = parser.parse_args()
     zeller(args.date_input)







from collections.abc import Callable






class  _lowerCAmelCase     :

      def __init__(   self      ,				__UpperCAmelCase = None		):
        # Stores actual heap items.
        lowerCAmelCase__				:  list		       =     []
        # Stores indexes of each item for supporting updates and deletion.
        lowerCAmelCase__				:  dict		       =     {}
        # Stores current size of heap.
        lowerCAmelCase__				:  Any		       =     0
        # Stores function used to evaluate the score of an item on which basis ordering
        # will be done.
        lowerCAmelCase__				:  Union[str, Any]		       =     key or (lambda __UpperCAmelCase		: x)

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        return int((i - 1) / 2		) if i > 0 else None

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Optional[Any]		       =     int(2 * i + 1		)
        return left if 0 < left < self.size else None

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  List[str]		       =     int(2 * i + 2		)
        return right if 0 < right < self.size else None

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        lowerCAmelCase__       ,			lowerCAmelCase__				:  List[str]		       =     (
            self.pos_map[self.arr[j][0]],
            self.pos_map[self.arr[i][0]],
        )
        # Then swap the items in the list.
        lowerCAmelCase__       ,			lowerCAmelCase__				:  Any		       =     self.arr[j], self.arr[i]

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        return self.arr[i][1] < self.arr[j][1]

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Optional[int]		       =     self._left(__UpperCAmelCase		)
        lowerCAmelCase__				:  Any		       =     self._right(__UpperCAmelCase		)
        lowerCAmelCase__				:  str		       =     i

        if left is not None and not self._cmp(__UpperCAmelCase      ,				__UpperCAmelCase		):
          lowerCAmelCase__				:  Dict		       =     left
        if right is not None and not self._cmp(__UpperCAmelCase      ,				__UpperCAmelCase		):
          lowerCAmelCase__				:  List[str]		       =     right

        return valid_parent

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Tuple		       =     self._parent(__UpperCAmelCase		)
        while parent is not None and not self._cmp(__UpperCAmelCase      ,				__UpperCAmelCase		):
          self._swap(__UpperCAmelCase      ,				__UpperCAmelCase		)
          lowerCAmelCase__       ,			lowerCAmelCase__				:  Dict		       =     parent, self._parent(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  str		       =     self._get_valid_parent(__UpperCAmelCase		)
        while valid_parent != index:
          self._swap(__UpperCAmelCase      ,				__UpperCAmelCase		)
          lowerCAmelCase__       ,			lowerCAmelCase__				:  List[Any]		       =     valid_parent, self._get_valid_parent(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        if item not in self.pos_map:
          return
        lowerCAmelCase__				:  Tuple		       =     self.pos_map[item]
        lowerCAmelCase__				:  Any		       =     [item, self.key(__UpperCAmelCase		)]
        # Make sure heap is right in both up and down direction.
        # Ideally only one of them will make any change.
        self._heapify_up(__UpperCAmelCase		)
        self._heapify_down(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase		):
        if item not in self.pos_map:
          return
        lowerCAmelCase__				:  Tuple		       =     self.pos_map[item]
        del self.pos_map[item]
        lowerCAmelCase__				:  Tuple		       =     self.arr[self.size - 1]
        lowerCAmelCase__				:  int		       =     index
        self.size -= 1
        # Make sure heap is right in both up and down direction. Ideally only one
        # of them will make any change- so no performance loss in calling both.
        if self.size > index:
          self._heapify_up(__UpperCAmelCase		)
          self._heapify_down(__UpperCAmelCase		)

      def 	__magic_name__(   self      ,				__UpperCAmelCase      ,				__UpperCAmelCase		):
        lowerCAmelCase__				:  Optional[int]		       =     len(self.arr		)
        if arr_len == self.size:
          self.arr.append([item, self.key(__UpperCAmelCase		)]		)
        else:
          lowerCAmelCase__				:  str		       =     [item, self.key(__UpperCAmelCase		)]
        lowerCAmelCase__				:  Optional[Any]		       =     self.size
        self.size += 1
        self._heapify_up(self.size - 1		)

      def 	__magic_name__(   self		):
        return self.arr[0] if self.size else None







      def 	__magic_name__(   self		):
        lowerCAmelCase__				:  int		       =     self.get_top()
        if top_item_tuple:
          self.delete_item(top_item_tuple[0]		)
        return top_item_tuple



def      __lowerCAmelCase			(					)     ->	None:
  pass


if __name__ == "__main__":
     import doctest

     doctest.testmod()

