def       A__   (						snake_case_			:		Optional[Any]							,					snake_case_			:		Tuple							,					snake_case_			:		Optional[Any]							,					snake_case_			:		Optional[Any]							,					snake_case_			:		int							,					snake_case_			:		List[str]   ):
 if index == r:
  for j in range(snake_case_   ):
   print(data[j]							,					end=''' '''   )
  print(''' '''   )
  return
 #  When no more elements are there to put in data[]
 if i >= n:
  return
 # current is included, put next at next location
 SCREAMING_SNAKE_CASE__: Union[str, Any]=   arr[i]
 combination_util(snake_case_							,					snake_case_							,					snake_case_							,					index + 1							,					snake_case_							,					i + 1   )
 # current is excluded, replace it with
 # next (Note that i+1 is passed, but
 # index is not changed)
 combination_util(snake_case_							,					snake_case_							,					snake_case_							,					snake_case_							,					snake_case_							,					i + 1   )
 # The main function that prints all combinations
 # of size r in arr[] of size n. This function
 # mainly uses combinationUtil()







def       A__   (						snake_case_			:		List[Any]							,					snake_case_			:		Optional[int]							,					snake_case_			:		Tuple   ):
 # A temporary array to store all combination one by one
 SCREAMING_SNAKE_CASE__: int=   [0] * r
 # Print all combination using temporary array 'data[]'
 combination_util(snake_case_							,					snake_case_							,					snake_case_							,					0							,					snake_case_							,					0   )


if __name__ == "__main__":
      # Driver code to check the function above
      lowercase_  : List[Any]								=					[1_0, 2_0, 3_0, 4_0, 5_0]
      print_combination(arr, len(arr), 3)
      # This code is contributed by Ambuj sahu




def 			lowerCAmelCase(      SCREAMING_SNAKE_CASE_ = 4_0_0_0_0_0_0			)->						int:



    """simple docstring"""






    UpperCamelCase_			  =						[0, 1]
    UpperCamelCase_			  =						0
    while fib[i] <= n:
        fib.append(fib[i] + fib[i + 1]			)
        if fib[i + 2] > n:
            break
        i += 1
    UpperCamelCase_			  =						0
    for j in range(len(SCREAMING_SNAKE_CASE_			) - 1			):
        if fib[j] % 2 == 0:
            total += fib[j]

    return total


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