


def 						lowerCamelCase(   a__):

				if len(a__) <= 1:
								return [tuple(a__)]

				_SCREAMING_SNAKE_CASE			  =[]

				def generate(a__	,a__):
								if k == 1:
												res.append(tuple(arr[:]))
												return

								generate(k - 1	,a__)

								for i in range(k - 1):
												if k % 2 == 0:  # k is even
																_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =arr[k - 1], arr[i]
												else:  # k is odd
																_SCREAMING_SNAKE_CASE  ,				_SCREAMING_SNAKE_CASE			  =arr[k - 1], arr[0]
												generate(k - 1	,a__)

				generate(len(a__)	,a__)
				return res


if __name__ == "__main__":
							snake_case_						:			List[Any]													=							input('''Enter numbers separated by a comma:\n''').strip()
							snake_case_						:			int													=							[int(item) for item in user_input.split(''',''')]
							print(heaps(arr))



import string
from math import logaa







def 						lowerCamelCase(   a__	,a__):
				_SCREAMING_SNAKE_CASE			  =document.translate(
				    str.maketrans(''''''	,''''''	,string.punctuation)).replace('''\n'''	,'''''')
				_SCREAMING_SNAKE_CASE			  =document_without_punctuation.split(''' ''')  # word tokenization
				return len([word for word in tokenize_document if word.lower() == term.lower()])







def 						lowerCamelCase(   a__	,a__):
				_SCREAMING_SNAKE_CASE			  =corpus.lower().translate(
				    str.maketrans(''''''	,''''''	,string.punctuation))  # strip all punctuation and replace it with ''
				_SCREAMING_SNAKE_CASE			  =corpus_without_punctuation.split('''\n''')
				_SCREAMING_SNAKE_CASE			  =term.lower()
				return (len([doc for doc in docs if term in doc]), len(a__))







def 						lowerCamelCase(   a__	,a__	,a__=False):
				if smoothing:
								if n == 0:
												raise ValueError('''log10(0) is undefined.''')
								return round(1 + logaa(n / (1 + df))	,3)

				if df == 0:
								raise ZeroDivisionError('''df must be > 0''')
				elif n == 0:
								raise ValueError('''log10(0) is undefined.''')
				return round(logaa(n / df)	,3)







def 						lowerCamelCase(   a__	,a__):
				return round(tf * idf	,3)