




'''simple docstring'''



def       _UpperCamelCase			(_lowerCamelCase				:  int ,						_lowerCamelCase				:  int						)-> int:




     '''simple docstring'''





     while b:
          __snake_case       ,     __snake_case            =	b, a % b
     return a







def       _UpperCamelCase			(_lowerCamelCase				:  int ,						_lowerCamelCase				:  int						)-> int:




     '''simple docstring'''





     return a if b == 0 else euclidean_gcd_recursive(_lowerCamelCase ,						a % b						)







def       _UpperCamelCase			()-> Optional[Any]:




     '''simple docstring'''





     print(f'''euclidean_gcd(3, 5) = {euclidean_gcd(3 ,						5						)}'''						)
     print(f'''euclidean_gcd(5, 3) = {euclidean_gcd(5 ,						3						)}'''						)
     print(f'''euclidean_gcd(1, 3) = {euclidean_gcd(1 ,						3						)}'''						)
     print(f'''euclidean_gcd(3, 6) = {euclidean_gcd(3 ,						6						)}'''						)
     print(f'''euclidean_gcd(6, 3) = {euclidean_gcd(6 ,						3						)}'''						)

     print(f'''euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3 ,						5						)}'''						)
     print(f'''euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5 ,						3						)}'''						)
     print(f'''euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1 ,						3						)}'''						)
     print(f'''euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3 ,						6						)}'''						)
     print(f'''euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6 ,						3						)}'''						)


if __name__ == "__main__":
     main()












'''simple docstring'''



def       _UpperCamelCase			(_lowerCamelCase				:  Optional[Any]						)-> Dict:




     '''simple docstring'''





     __snake_case            =	[]
     __snake_case            =	[]
     __snake_case            =	{
         '''^''': 3,
         '''*''': 2,
         '''/''': 2,
         '''%''': 2,
         '''+''': 1,
         '''-''': 1,
     }  # Priority of each operator
     __snake_case            =	len(_lowerCamelCase						) if (len(_lowerCamelCase						) > 7) else 7

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

     for x in infix:
          if x.isalpha() or x.isdigit():
               post_fix.append(_lowerCamelCase						)  # if x is Alphabet / Digit, add it to Postfix
          elif x == "(":
               stack.append(_lowerCamelCase						)  # 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(_lowerCamelCase						) == 0:
                    stack.append(_lowerCamelCase						)  # If stack is empty, push x to stack
               else:  # while priority of x is not > priority of element in the stack
                    while len(_lowerCamelCase						) > 0 and priority[x] <= priority[stack[-1]]:
                         post_fix.append(stack.pop()						)  # pop stack & add to Postfix
                    stack.append(_lowerCamelCase						)  # push x to stack

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

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

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







def       _UpperCamelCase			(_lowerCamelCase				:  Optional[Any]						)-> str:




     '''simple docstring'''





     __snake_case            =	list(infix[::-1]						)  # reverse the infix equation

     for i in range(len(_lowerCamelCase						)						):
          if infix[i] == "(":
               __snake_case            =	''')'''  # change "(" to ")"
          elif infix[i] == ")":
               __snake_case            =	'''('''  # change ")" to "("

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


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






