

def 							_lowerCamelCase   (			):
      '''simple docstring'''







      A_							       =		[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

      A_							       =		6
      A_							       =		1
      A_							       =		1901

      A_							       =		0

      while year < 2001:
            day += 7

            if (year % 4 == 0 and year % 100 != 0) or (year % 400 == 0):
                  if day > days_per_month[month - 1] and month != 2:
                        month += 1
                        A_							       =		day - days_per_month[month - 2]
                  elif day > 29 and month == 2:
                        month += 1
                        A_							       =		day - 29
            else:
                  if day > days_per_month[month - 1]:
                        month += 1
                        A_							       =		day - days_per_month[month - 2]

            if month > 12:
                  year += 1
                  A_							       =		1

            if year < 2001 and day == 1:
                  sundays += 1
      return sundays


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








__lowercase				      =						"""Alexander Joslin"""

import operator as op

from .stack import Stack







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







      A_							       =		{'''*''': op.mul, '''/''': op.truediv, '''+''': op.add, '''-''': op.sub}

      A_							       =		Stack()
      A_							       =		Stack()

      for i in equation:
            if i.isdigit():
                  # RULE 1
                  operand_stack.push(int(SCREAMING_SNAKE_CASE   )   )
            elif i in operators:
                  # RULE 2
                  operator_stack.push(SCREAMING_SNAKE_CASE   )
            elif i == ")":
                  # RULE 4
                  A_							       =		operator_stack.peek()
                  operator_stack.pop()
                  A_							       =		operand_stack.peek()
                  operand_stack.pop()
                  A_							       =		operand_stack.peek()
                  operand_stack.pop()

                  A_							       =		operators[opr](SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   )
                  operand_stack.push(SCREAMING_SNAKE_CASE   )

    # RULE 5
      return operand_stack.peek()


if __name__ == "__main__":
      __lowercase				      =						"""(5 + ((4 * 2) * (2 + 3)))"""
      # answer = 45
      print(f'{equation} = {dijkstras_two_stack_algorithm(equation)}')





