
def       _lowercase					(      __SCREAMING_SNAKE_CASE				,    __SCREAMING_SNAKE_CASE )	->     int:
			for index, item in enumerate(__SCREAMING_SNAKE_CASE ):
						if item == target:
									return index
			return -1



def       _lowercase					(      __SCREAMING_SNAKE_CASE				,    __SCREAMING_SNAKE_CASE				,    __SCREAMING_SNAKE_CASE				,    __SCREAMING_SNAKE_CASE )	->     int:
			if not (0 <= high < len(__SCREAMING_SNAKE_CASE ) and 0 <= low < len(__SCREAMING_SNAKE_CASE )):
						raise Exception('Invalid upper or lower bound!' )
			if high < low:
						return -1
			if sequence[low] == target:
						return low
			if sequence[high] == target:
						return high
			return rec_linear_search(__SCREAMING_SNAKE_CASE				,    low + 1				,    high - 1				,    __SCREAMING_SNAKE_CASE )


if __name__ == "__main__":
							UpperCAmelCase__				:  str       					=				input('''Enter numbers separated by comma:\n''').strip()
							UpperCAmelCase__				:  Optional[Any]       					=				[int(item.strip()) for item in user_input.split(''',''')]

							UpperCAmelCase__				:  Dict       					=				int(input('''Enter a single number to be found in the list:\n''').strip())
							UpperCAmelCase__				:  Optional[Any]       					=				linear_search(sequence, target)
							if result != -1:
														print(f'''linear_search({sequence}, {target}) = {result}''')
							else:
														print(f'''{target} was not found in {sequence}''')





import numpy as np

UpperCAmelCase__				:  str       					=				[
    ['''a''', '''b''', '''c''', '''d''', '''e'''],
    ['''f''', '''g''', '''h''', '''i''', '''k'''],
    ['''l''', '''m''', '''n''', '''o''', '''p'''],
    ['''q''', '''r''', '''s''', '''t''', '''u'''],
    ['''v''', '''w''', '''x''', '''y''', '''z'''],
]



class 			UpperCamelCase_			:




							'''simple docstring'''

							def __init__(				self) ->	None:
										UpperCamelCase__    :		Any     =				np.array(UpperCamelCase)
							def        lowerCAmelCase__ (				self     ,						UpperCamelCase) ->	np.ndarray:
										UpperCamelCase__   ,			UpperCamelCase__    :		Optional[int]     =				np.where(letter == self.SQUARE)
										UpperCamelCase__    :		int     =				np.concatenate([indexa + 1, indexa + 1])
										return indexes
							def        lowerCAmelCase__ (				self     ,						UpperCamelCase     ,						UpperCamelCase) ->	str:
										return self.SQUARE[indexa - 1, indexa - 1]
							def        lowerCAmelCase__ (				self     ,						UpperCamelCase) ->	str:
										UpperCamelCase__    :		str     =				message.lower()
										UpperCamelCase__    :		int     =				message.replace('j'     ,						'i')

										UpperCamelCase__    :		List[Any]     =				''
										for letter_index in range(len(UpperCamelCase)):
													if message[letter_index] != " ":
																UpperCamelCase__    :		Union[str, Any]     =				self.letter_to_numbers(message[letter_index])
																UpperCamelCase__    :		int     =				encoded_message + str(numbers[0]) + str(numbers[1])
													elif message[letter_index] == " ":
																UpperCamelCase__    :		str     =				encoded_message + ' '

										return encoded_message






							def        lowerCAmelCase__ (				self     ,						UpperCamelCase) ->	str:
										UpperCamelCase__    :		Union[str, Any]     =				message.replace(' '     ,						'  ')
										UpperCamelCase__    :		int     =				''
										for numbers_index in range(int(len(UpperCamelCase) / 2)):
													if message[numbers_index * 2] != " ":
																UpperCamelCase__    :		List[str]     =				message[numbers_index * 2]
																UpperCamelCase__    :		Tuple     =				message[numbers_index * 2 + 1]

																UpperCamelCase__    :		Tuple     =				self.numbers_to_letter(int(UpperCamelCase)     ,						int(UpperCamelCase))
																UpperCamelCase__    :		List[str]     =				decoded_message + letter
													elif message[numbers_index * 2] == " ":
																UpperCamelCase__    :		str     =				decoded_message + ' '

										return decoded_message



