
A		: str								=     [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
A		: List[Any]								=     [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
A		: Optional[int]								=     {
    0: '''Sunday''',
    1: '''Monday''',
    2: '''Tuesday''',
    3: '''Wednesday''',
    4: '''Thursday''',
    5: '''Friday''',
    6: '''Saturday''',
}




def 	UpperCamelCase__  (     SCREAMING_SNAKE_CASE_	:	str		,   SCREAMING_SNAKE_CASE_	:	Tuple		,   SCREAMING_SNAKE_CASE_	:	Dict       )  ->     List[Any]:
						assert len(str(SCREAMING_SNAKE_CASE_       )       ) > 2, "year should be in YYYY format"
						assert 1 <= month <= 12, "month should be between 1 to 12"
						assert 1 <= day <= 31, "day should be between 1 to 31"

						# Doomsday algorithm:
						_lowercase					       =					year // 1_00
						_lowercase					       =					(5 * (century % 4) + 2) % 7
						_lowercase					       =					year % 1_00
						_lowercase					       =					centurian % 12
						_lowercase					       =					(
						    (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
						) % 7
						_lowercase					       =					(
						    DOOMSDAY_NOT_LEAP[month - 1]
						    if (year % 4 != 0) or (centurian == 0 and (year % 4_00) == 0)
						    else DOOMSDAY_LEAP[month - 1]
						)
						_lowercase					       =					(dooms_day + day - day_anchor) % 7
						return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
		import doctest

		doctest.testmod()


def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE = 100   ):
      '''simple docstring'''







      A_							       =		0
      A_							       =		0
      for i in range(1		,				n + 1   ):
            sum_of_squares += i**2
            sum_of_ints += i
      return sum_of_ints**2 - sum_of_squares


if __name__ == "__main__":
      print(f'{solution() = }')





