


import operator as op






def 							__lowercase     (				__lowerCAmelCase							:       int     ):
							a__    =  []
							a__    =  lambda __lowerCAmelCase      ,					__lowerCAmelCase     : int(x / y     )  # noqa: E731 integer division operation
							a__    =  {
							    '^': op.pow,
							    '*': op.mul,
							    '/': div,
							    '+': op.add,
							    '-': op.sub,
							}  # operators & their respective operation

							# print table header
							print('Symbol'.center(8     )      ,					'Action'.center(1_2     )      ,					'Stack'      ,					sep=' | '     )
							print('-' * (3_0 + len(__lowerCAmelCase     ))     )

							for x in post_fix:
														if x.isdigit():  # if x in digit
																					stack.append(__lowerCAmelCase     )  # append x to stack
																					# output in tabular format
																					print(x.rjust(8     )      ,					('push(' + x + ')').ljust(1_2     )      ,					','.join(__lowerCAmelCase     )      ,					sep=' | '     )
														else:
																					a__    =  stack.pop()  # pop stack
																					# output in tabular format
																					print(''.rjust(8     )      ,					('pop(' + b + ')').ljust(1_2     )      ,					','.join(__lowerCAmelCase     )      ,					sep=' | '     )

																					a__    =  stack.pop()  # pop stack
																					# output in tabular format
																					print(''.rjust(8     )      ,					('pop(' + a + ')').ljust(1_2     )      ,					','.join(__lowerCAmelCase     )      ,					sep=' | '     )

																					stack.append(
																					    str(opr[x](int(__lowerCAmelCase     )      ,					int(__lowerCAmelCase     )     )     )     )  # evaluate the 2 values popped from stack & push result to stack
																					# output in tabular format
																					print(
																					    x.rjust(8     )      ,					('push(' + a + x + b + ')').ljust(1_2     )      ,					','.join(__lowerCAmelCase     )      ,					sep=' | '      ,					)

							return int(stack[0]     )


if __name__ == "__main__":
						snake_case							: Tuple      =   input('''\n\nEnter a Postfix Equation (space separated) = ''').split(''' ''')
						print('''\n\tResult = ''', solve(Postfix))








# Copyright 2023 The HuggingFace Inc. team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
import re

from ..utils import cached_file


# docstyle-ignore
snake_case							: Dict      =   '''
Human: <<task>>

Assistant: '''


snake_case							: Optional[int]      =   '''huggingface-tools/default-prompts'''
snake_case							: Tuple      =   {'''chat''': '''chat_prompt_template.txt''', '''run''': '''run_prompt_template.txt'''}






def 							__lowercase     (				__lowerCAmelCase							:       Any      ,					__lowerCAmelCase							:       Union[str, Any]      ,					__lowerCAmelCase							:       Any="run"     ):
							if prompt_or_repo_id is None:
														a__    =  DEFAULT_PROMPTS_REPO

							# prompt is considered a repo ID when it does not contain any kind of space
							if re.search('\\s'      ,					__lowerCAmelCase     ) is not None:
														return prompt_or_repo_id

							a__    =  cached_file(
							    __lowerCAmelCase      ,					PROMPT_FILES[mode]      ,					repo_type='dataset'      ,					user_agent={'agent': agent_name}     )
							with open(__lowerCAmelCase      ,					'r'      ,					encoding='utf-8'     ) as f:
														return f.read()




