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



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       int ,     __UpperCamelCase    :       int ,     __UpperCamelCase    :       int	)							->					str:







  """simple docstring"""





  assert len(str(__lowerCamelCase	)	) > 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:
  SCREAMING_SNAKE_CASE__										=      year // 1_00
  SCREAMING_SNAKE_CASE__										=      (5 * (century % 4) + 2) % 7
  SCREAMING_SNAKE_CASE__										=      year % 1_00
  SCREAMING_SNAKE_CASE__										=      centurian % 12
  SCREAMING_SNAKE_CASE__										=      (
      (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
  ) % 7
  SCREAMING_SNAKE_CASE__										=      (
      DOOMSDAY_NOT_LEAP[month - 1]
      if (year % 4 != 0) or (centurian == 0 and (year % 4_00) == 0)
      else DOOMSDAY_LEAP[month - 1]
  )
  SCREAMING_SNAKE_CASE__										=      (dooms_day + day - day_anchor) % 7
  return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
   import doctest

   doctest.testmod()







'''simple docstring'''

from __future__ import annotations

import math





def lowerCamelCase						(     __lowerCamelCase :    int    )						->list[int]:

    if num <= 0:
        _SCREAMING_SNAKE_CASE									=			F'{num}: Invalid input, please enter a positive integer.'
        raise ValueError(__lowerCamelCase    )

    _SCREAMING_SNAKE_CASE									=			[True] * (num + 1)
    _SCREAMING_SNAKE_CASE									=			[]
    _SCREAMING_SNAKE_CASE									=			2
    _SCREAMING_SNAKE_CASE									=			int(math.sqrt(__lowerCamelCase    )    )

    while start <= end:
        # If start is a prime
        if sieve[start] is True:
            prime.append(__lowerCamelCase    )

            # Set multiples of start be False
            for i in range(start * start					,       num + 1					,       __lowerCamelCase    ):
                if sieve[i] is True:
                    _SCREAMING_SNAKE_CASE									=			False

        start += 1

    for j in range(end + 1					,       num + 1    ):
        if sieve[j] is True:
            prime.append(__lowerCamelCase    )

    return prime


if __name__ == "__main__":
      print(prime_sieve(int(input("""Enter a positive integer: """).strip())))



