





"""simple docstring"""






from math import pi

def       __A (     a_  :int				,    a_  :int)						->						float:
				return 2 * pi * radius * (angle / 3_60)


if __name__ == "__main__":
		print(arc_length(90, 10))






"""simple docstring"""






def       __A (     a_  :int)						->						Union[str, Any]:
				__a	:  int         =					[]
				__a	:  Dict         =					[]
				__a	:  str         =					{
				    '''^''': 3,
				    '''*''': 2,
				    '''/''': 2,
				    '''%''': 2,
				    '''+''': 1,
				    '''-''': 1,
				}  # Priority of each operator
				__a	:  Tuple         =					len(a_) if (len(a_) > 7) else 7

				# Print table header for output
				print(
				    '''Symbol'''.center(8)				,    '''Stack'''.center(a_)				,    '''Postfix'''.center(a_)				,    sep=''' | '''				,    )
				print('''-''' * (print_width * 3 + 7))

				for x in infix:
								if x.isalpha() or x.isdigit():
												post_fix.append(a_)  # if x is Alphabet / Digit, add it to Postfix
								elif x == "(":
												stack.append(a_)  # if x is "(" push to Stack
								elif x == ")":  # if x is ")" pop stack until "(" is encountered
												while stack[-1] != "(":
																post_fix.append(stack.pop())  # Pop stack & add the content to Postfix
												stack.pop()
								else:
												if len(a_) == 0:
																stack.append(a_)  # If stack is empty, push x to stack
												else:  # while priority of x is not > priority of element in the stack
																while len(a_) > 0 and priority[x] <= priority[stack[-1]]:
																				post_fix.append(stack.pop())  # pop stack & add to Postfix
																stack.append(a_)  # push x to stack

								print(
								    x.center(8)				,    (''''''.join(a_)).ljust(a_)				,    (''''''.join(a_)).ljust(a_)				,    sep=''' | '''				,    )  # Output in tabular format

				while len(a_) > 0:  # while stack is not empty
								post_fix.append(stack.pop())  # pop stack & add to Postfix
								print(
								    ''' '''.center(8)				,    (''''''.join(a_)).ljust(a_)				,    (''''''.join(a_)).ljust(a_)				,    sep=''' | '''				,    )  # Output in tabular format

				return "".join(a_)  # return Postfix as str

def       __A (     a_  :int)						->						List[Any]:
				__a	:  Dict         =					list(infix[::-1])  # reverse the infix equation

				for i in range(len(a_)):
								if infix[i] == "(":
												__a	:  Union[str, Any]         =					''')'''  # change "(" to ")"
								elif infix[i] == ")":
												__a	:  List[str]         =					'''('''  # change ")" to "("

				return (infix_2_postfix(''''''.join(a_)))[
				    ::-1
				]  # call infix_2_postfix on Infix, return reverse of Postfix


if __name__ == "__main__":
		A	     =					input('''\nEnter an Infix Equation = ''')  # Input an Infix equation
		A	     =					''''''.join(Infix.split())  # Remove spaces from the input
		print('''\n\t''', Infix, '''(Infix) -> ''', infix_2_prefix(Infix), '''(Prefix)''')