import requests
from bsa import BeautifulSoup


def 	lowerCamelCase					(	UpperCamelCase     :				str = "AAPL"							)   ->    str:
		_lowerCamelCase				   =  F"""https://in.finance.yahoo.com/quote/{symbol}?s={symbol}"""
		_lowerCamelCase				   =  BeautifulSoup(requests.get(UpperCamelCase							).text			,       'html.parser'							)
		_lowerCamelCase				   =  'My(6px) Pos(r) smartphone_Mt(6px)'
		return soup.find('div'			,       class_=class_							).find('span'							).text


if __name__ == "__main__":
				for symbol in "AAPL AMZN IBM GOOG MSFT ORCL".split():
								print(F'''Current {symbol:<4} stock price is {stock_price(symbol):>8}''')
def 	lowerCamelCase					(	UpperCamelCase     :				int			,       UpperCamelCase     :				int							)   ->    str:
		if number < 0 or shift_amount < 0:
				raise ValueError('both inputs must be positive integers'							)

		_lowerCamelCase				   =  str(bin(UpperCamelCase							)							)
		binary_number += "0" * shift_amount
		return binary_number


def 	lowerCamelCase					(	UpperCamelCase     :				int			,       UpperCamelCase     :				int							)   ->    str:
		if number < 0 or shift_amount < 0:
				raise ValueError('both inputs must be positive integers'							)

		_lowerCamelCase				   =  str(bin(UpperCamelCase							)							)[2:]
		if shift_amount >= len(UpperCamelCase							):
				return "0b0"
		_lowerCamelCase				   =  binary_number[: len(UpperCamelCase							) - shift_amount]
		return "0b" + shifted_binary_number


def 	lowerCamelCase					(	UpperCamelCase     :				int			,       UpperCamelCase     :				int							)   ->    str:
		if number >= 0:  # Get binary representation of positive number
				_lowerCamelCase				   =  '0' + str(bin(UpperCamelCase							)							).strip('-'							)[2:]
		else:  # Get binary (2's complement) representation of negative number
				_lowerCamelCase				   =  len(bin(UpperCamelCase							)[3:]							)  # Find 2's complement of number
				_lowerCamelCase				   =  bin(abs(UpperCamelCase							) - (1 << binary_number_length)							)[3:]
				_lowerCamelCase				   =  (
				    '1' + '0' * (binary_number_length - len(UpperCamelCase							)) + binary_number
				)

		if shift_amount >= len(UpperCamelCase							):
				return "0b" + binary_number[0] * len(UpperCamelCase							)
		return (
		    "0b"
		    + binary_number[0] * shift_amount
		    + binary_number[: len(UpperCamelCase							) - shift_amount]
		)


if __name__ == "__main__":
				import doctest

				doctest.testmod()