





'''simple docstring'''

def  a__    (    lowercase :					Union[str, Any], lowercase :					int, lowercase :					Optional[Any], lowercase :					int				)		->		str:





     """simple docstring"""

     _UpperCamelCase       =	[False] * len(__UpperCAmelCase				)
     _UpperCamelCase       =	[]
     queue.append(__UpperCAmelCase				)
     _UpperCamelCase       =	True

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

     return visited[t]







def  a__    (    lowercase :					List[str], lowercase :					List[str], lowercase :					Tuple				)		->		Tuple:





     """simple docstring"""

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

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

          max_flow += path_flow
          _UpperCamelCase       =	sink

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


lowercase__						:      List[Any]	=    [
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

lowercase__						:      Tuple	=    0, 5




print(ford_fulkerson(graph, source, sink))










'''simple docstring'''

def  a__    (    lowercase :					int, lowercase :					int				)		->		int:





     """simple docstring"""

     return x if y == 0 else greatest_common_divisor(lowercase, x % y				)







def  a__    (    lowercase :					int, lowercase :					int				)		->		int:





     """simple docstring"""

     return (x * y) // greatest_common_divisor(lowercase, lowercase				)







def  a__    (    lowercase :					int = 20				)		->		int:





     """simple docstring"""

     _UpperCamelCase       =	1
     for i in range(1, n + 1				):
          _UpperCamelCase       =	lcm(lowercase, lowercase				)
     return g


if __name__ == "__main__":
   print(F"""{solution() = }""")



