




'''simple docstring'''







def 						_A      ( UpperCAmelCase      ,UpperCAmelCase      ,UpperCAmelCase      ,UpperCAmelCase						):






   '''simple docstring'''







   A__       =     [False] * len(UpperCAmelCase						)
   A__       =     []
   queue.append(UpperCAmelCase						)
   A__       =     True

   while queue:
      A__       =     queue.pop(0						)
      for ind in range(len(graph[u]						)						):
         if visited[ind] is False and graph[u][ind] > 0:
            queue.append(UpperCAmelCase						)
            A__       =     True
            A__       =     u

   return visited[t]







def 						_A      ( UpperCAmelCase      ,UpperCAmelCase      ,UpperCAmelCase						):






   '''simple docstring'''







   A__       =     [-1] * (len(UpperCAmelCase						))
   A__       =     0
   while bfs(UpperCAmelCase      ,UpperCAmelCase      ,UpperCAmelCase      ,UpperCAmelCase						):
      A__       =     float('Inf'						)
      A__       =     sink

      while s != source:
         # Find the minimum value in select path
         A__       =     min(UpperCAmelCase      ,graph[parent[s]][s]						)
         A__       =     parent[s]

      max_flow += path_flow
      A__       =     sink

      while v != source:
         A__       =     parent[v]
         graph[u][v] -= path_flow
         graph[v][u] += path_flow
         A__       =     parent[v]
   return max_flow


lowerCAmelCase_     						=				[
    [0, 1_6, 1_3, 0, 0, 0],
    [0, 0, 1_0, 1_2, 0, 0],
    [0, 4, 0, 0, 1_4, 0],
    [0, 0, 9, 0, 0, 2_0],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

lowerCAmelCase_						,       lowerCAmelCase_     						=				0, 5







print(ford_fulkerson(graph, source, sink))








'''simple docstring'''







def 						_A      ( ):






   '''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())


