





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



def 	_a						(   UpperCAmelCase      ,  UpperCAmelCase      ,  UpperCAmelCase					)    ->    str:







   """simple docstring"""
   assert len(str(UpperCAmelCase					)					) > 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:
   lowerCamelCase__       :						Optional[int]        =							year // 100
   lowerCamelCase__       :						Any        =							(5 * (century % 4) + 2) % 7
   lowerCamelCase__       :						int        =							year % 100
   lowerCamelCase__       :						List[str]        =							centurian % 12
   lowerCamelCase__       :						Union[str, Any]        =							(
       (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
   ) % 7
   lowerCamelCase__       :						Optional[int]        =							(
       DOOMSDAY_NOT_LEAP[month - 1]
       if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
       else DOOMSDAY_LEAP[month - 1]
   )
   lowerCamelCase__       :						Dict        =							(dooms_day + day - day_anchor) % 7
   return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
       import doctest

       doctest.testmod()










def 	_a						(   UpperCAmelCase					)    ->    bool:







   """simple docstring"""
   return str(UpperCAmelCase					) == str(UpperCAmelCase					)[::-1]



def 	_a						(   UpperCAmelCase					)    ->    int:







   """simple docstring"""
   return int(UpperCAmelCase					) + int(str(UpperCAmelCase					)[::-1]					)



def 	_a						(   UpperCAmelCase = 10000					)    ->    int:







   """simple docstring"""
   lowerCamelCase__       :						Tuple        =							[]
   for num in range(1      ,  UpperCAmelCase					):
      lowerCamelCase__       :						List[str]        =							0
      lowerCamelCase__       :						Union[str, Any]        =							num
      while iterations < 50:
         lowerCamelCase__       :						Dict        =							sum_reverse(UpperCAmelCase					)
         iterations += 1
         if is_palindrome(UpperCAmelCase					):
            break
      else:
         lychrel_nums.append(UpperCAmelCase					)
   return len(UpperCAmelCase					)


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



