



def 		_UpperCAmelCase				(      snake_case = 10**9			):





					"""simple docstring"""

					_lowerCAmelCase						=    1
					_lowerCAmelCase						=    2

					_lowerCAmelCase						=    0
					_lowerCAmelCase						=    0
					_lowerCAmelCase						=    0
					while perimeter <= max_perimeter:
										perimeters_sum += perimeter

										prev_value += 2 * value
										value += prev_value

										_lowerCAmelCase						=    2 * value + 2 if i % 2 == 0 else 2 * value - 2
										i += 1

					return perimeters_sum


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






def 			UpperCAmelCase__				(			_A      : dict							):





  '''simple docstring'''







  a__  =set()
  # To detect a back edge, keep track of vertices currently in the recursion stack
  a__  =set()
  return any(
      node not in visited and depth_first_search(_A	,      _A	,      _A	,      _A							)
      for node in graph							)




def 			UpperCAmelCase__				(			_A      : dict	,      _A      : int	,      _A      : set	,      _A      : set							):





  '''simple docstring'''







  visited.add(_A							)
  rec_stk.add(_A							)

  for node in graph[vertex]:
    if node not in visited:
      if depth_first_search(_A	,      _A	,      _A	,      _A							):
        return True
    elif node in rec_stk:
      return True

    # The node needs to be removed from recursion stack before function ends
  rec_stk.remove(_A							)
  return False


if __name__ == "__main__":
       from doctest import testmod

       testmod()
