
def 		_UpperCAmelCase (						UpperCamelCase:  int	):






	"""simple docstring"""


	assert isinstance(_A      ,				_A	), F"The input value of [n={number}] is not an integer"

	if number == 1:
		return 2
	elif number < 1:
		__lowerCAmelCase    =				F"The input value of [n={number}] has to be > 0"
		raise ValueError(_A	)
	else:
		__lowerCAmelCase    =				sylvester(number - 1	)
		__lowerCAmelCase    =				num - 1
		__lowerCAmelCase    =				num
		return lower * upper + 1


if __name__ == "__main__":
					print(f'''The 8th number in Sylvester\'s sequence: {sylvester(8)}''')







'''simple docstring'''

from __future__ import annotations







def __UpperCamelCase( _A       :					list[int]	,      _A       :					int	,      _A       :					int	,      _A       :					int     ):
   '''simple docstring'''
   if (direction == 1 and array[indexa] > array[indexa]) or (
       direction == 0 and array[indexa] < array[indexa]
   ):
      UpperCAmelCase__					,   UpperCAmelCase__				:					Union[str, Any] 					=	array[indexa], array[indexa]







def __UpperCamelCase( _A       :					list[int]	,      _A       :					int	,      _A       :					int	,      _A       :					int     ):
   '''simple docstring'''
   if length > 1:
      UpperCAmelCase__				:					List[Any] 					=	int(length / 2     )
      for i in range(_A	,      low + middle     ):
         comp_and_swap(_A	,      _A	,      i + middle	,      _A     )
      bitonic_merge(_A	,      _A	,      _A	,      _A     )
      bitonic_merge(_A	,      low + middle	,      _A	,      _A     )







def __UpperCamelCase( _A       :					list[int]	,      _A       :					int	,      _A       :					int	,      _A       :					int     ):
   '''simple docstring'''
   if length > 1:
      UpperCAmelCase__				:					Optional[int] 					=	int(length / 2     )
      bitonic_sort(_A	,      _A	,      _A	,      1     )
      bitonic_sort(_A	,      low + middle	,      _A	,      0     )
      bitonic_merge(_A	,      _A	,      _A	,      _A     )


if __name__ == "__main__":
  UpperCamelCase__  :						Dict					=      input('Enter numbers separated by a comma:\n').strip()
  UpperCamelCase__  :						Tuple					=      [int(item.strip()) for item in user_input.split(',')]

  bitonic_sort(unsorted, 0, len(unsorted), 1)
  print('\nSorted array in ascending order is: ', end='')
  print(*unsorted, sep=', ')

  bitonic_merge(unsorted, 0, len(unsorted), 0)
  print('Sorted array in descending order is: ', end='')
  print(*unsorted, sep=', ')




