def __a (	)	->							Dict:
      '''simple docstring'''


      lowercase_     =      [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

      lowercase_     =      6
      lowercase_     =      1
      lowercase_     =      1_901

      lowercase_     =      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_     =      day - days_per_month[month - 2]
                  elif day > 29 and month == 2:
                        month += 1
                        lowercase_     =      day - 29
            else:
                  if day > days_per_month[month - 1]:
                        month += 1
                        lowercase_     =      day - days_per_month[month - 2]

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

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


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







'''simple docstring'''

def __a (	__lowerCamelCase			:						list[int] ,		__lowerCamelCase			:						int				)	->							bool:
      '''simple docstring'''


      lowercase_     =      len(__lowerCamelCase				)
      lowercase_     =      [[False] * (required_sum + 1) for _ in range(arr_len + 1				)]

      # for each arr value, a sum of zero(0) can be formed by not taking any element
      # hence True/1
      for i in range(arr_len + 1				):
            lowercase_     =      True

      # sum is not zero and set is empty then false
      for i in range(1 ,		required_sum + 1				):
            lowercase_     =      False

      for i in range(1 ,		arr_len + 1				):
            for j in range(1 ,		required_sum + 1				):
                  if arr[i - 1] > j:
                        lowercase_     =      subset[i - 1][j]
                  if arr[i - 1] <= j:
                        lowercase_     =      subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

      return subset[arr_len][required_sum]


if __name__ == "__main__":
       import doctest

       doctest.testmod()






