

def 	snake_case__			(    ):



     '''simple docstring'''





     lowercase__    :   str      =       [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

     lowercase__    :   List[str]      =       6
     lowercase__    :   Optional[Any]      =       1
     lowercase__    :   Dict      =       1_901

     lowercase__    :   str      =       0

     while year < 2_001:
          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
                    lowercase__    :   Optional[int]      =       day - days_per_month[month - 2]
               elif day > 29 and month == 2:
                    month += 1
                    lowercase__    :   Optional[Any]      =       day - 29
          else:
               if day > days_per_month[month - 1]:
                    month += 1
                    lowercase__    :   Tuple      =       day - days_per_month[month - 2]

          if month > 12:
               year += 1
               lowercase__    :   Optional[Any]      =       1

          if year < 2_001 and day == 1:
               sundays += 1
     return sundays


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




from __future__ import annotations

def 	snake_case__			(    SCREAMING_SNAKE_CASE_		:    dict	,     SCREAMING_SNAKE_CASE_		:    str			):



     '''simple docstring'''





     lowercase__      , lowercase__    :   List[str]      =       set(SCREAMING_SNAKE_CASE_			), [start]

     while stack:
          lowercase__    :   Union[str, Any]      =       stack.pop()
          explored.add(SCREAMING_SNAKE_CASE_			)
          # Differences from BFS:
          # 1) pop last element instead of first one
          # 2) add adjacent elements to stack without exploring them
          for adj in reversed(graph[v]			):
               if adj not in explored:
                    stack.append(SCREAMING_SNAKE_CASE_			)
     return explored


snake_case_			  = {
    '''A''': ['''B''', '''C''', '''D'''],
    '''B''': ['''A''', '''D''', '''E'''],
    '''C''': ['''A''', '''F'''],
    '''D''': ['''B''', '''D'''],
    '''E''': ['''B''', '''F'''],
    '''F''': ['''C''', '''E''', '''G'''],
    '''G''': ['''F'''],
}

if __name__ == "__main__":
       import doctest

       doctest.testmod()
       print(depth_first_search(G, '''A'''))

