
"""simple docstring"""







from __future__ import annotations

import bisect
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase = 0 ,						_UpperCamelCase = -1	):
	if hi < 0:
		__lowerCAmelCase    :		Optional[Any]		    =   len(_UpperCamelCase	)

	while lo < hi:
		__lowerCAmelCase    :		Optional[int]		    =   lo + (hi - lo) // 2
		if sorted_collection[mid] < item:
			__lowerCAmelCase    :		Tuple		    =   mid + 1
		else:
			__lowerCAmelCase    :		Union[str, Any]		    =   mid

	return lo
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase = 0 ,						_UpperCamelCase = -1	):
	if hi < 0:
		__lowerCAmelCase    :		Union[str, Any]		    =   len(_UpperCamelCase	)

	while lo < hi:
		__lowerCAmelCase    :		int		    =   lo + (hi - lo) // 2
		if sorted_collection[mid] <= item:
			__lowerCAmelCase    :		str		    =   mid + 1
		else:
			__lowerCAmelCase    :		int		    =   mid

	return lo
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase = 0 ,						_UpperCamelCase = -1	):
	sorted_collection.insert(bisect_left(_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase	) ,						_UpperCamelCase	)
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase = 0 ,						_UpperCamelCase = -1	):
	sorted_collection.insert(bisect_right(_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase	) ,						_UpperCamelCase	)
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase	):
	__lowerCAmelCase    :		int		    =   0
	__lowerCAmelCase    :		Optional[Any]		    =   len(_UpperCamelCase	) - 1

	while left <= right:
		__lowerCAmelCase    :		Optional[int]		    =   left + (right - left) // 2
		__lowerCAmelCase    :		str		    =   sorted_collection[midpoint]
		if current_item == item:
			return midpoint
		elif item < current_item:
			__lowerCAmelCase    :		Dict		    =   midpoint - 1
		else:
			__lowerCAmelCase    :		str		    =   midpoint + 1
	return None
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase	):
	__lowerCAmelCase    :		Optional[int]		    =   bisect.bisect_left(_UpperCamelCase ,						_UpperCamelCase	)
	if index != len(_UpperCamelCase	) and sorted_collection[index] == item:
		return index
	return None
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase	):
	if right < left:
		return None

	__lowerCAmelCase    :		Optional[Any]		    =   left + (right - left) // 2

	if sorted_collection[midpoint] == item:
		return midpoint
	elif sorted_collection[midpoint] > item:
		return binary_search_by_recursion(_UpperCamelCase ,						_UpperCamelCase ,						_UpperCamelCase ,						midpoint - 1	)
	else:
		return binary_search_by_recursion(_UpperCamelCase ,						_UpperCamelCase ,						midpoint + 1 ,						_UpperCamelCase	)


if __name__ == "__main__":
							lowerCamelCase__           =	input("""Enter numbers separated by comma:\n""").strip()
							lowerCamelCase__           =	sorted(int(item) for item in user_input.split(""","""))
							lowerCamelCase__           =	int(input("""Enter a single number to be found in the list:\n"""))
							lowerCamelCase__           =	binary_search(collection, target)
							if result is None:
														print(f'{target} was not found in {collection}.')
							else:
														print(f'{target} was found at position {result} in {collection}.')

"""simple docstring"""







def 					__lowerCAmelCase       (_UpperCamelCase	):
	if n_term == "":
		return []
	__lowerCAmelCase    :		list		    =   []
	for temp in range(int(_UpperCamelCase	)	):
		series.append(F"1/{temp + 1}" if series else '1'	)
	return series


if __name__ == "__main__":
							lowerCamelCase__           =	input("""Enter the last number (nth term) of the Harmonic Series""")
							print("""Formula of Harmonic Series => 1+1/2+1/3 ..... 1/n""")
							print(harmonic_series(nth_term))