

import operator as op


def    __a							( SCREAMING_SNAKE_CASE   )   ->  str:






    '''simple docstring'''
    __UpperCAmelCase					       =      []
    __UpperCAmelCase					       =      lambda SCREAMING_SNAKE_CASE							, SCREAMING_SNAKE_CASE   : int(x / y   )  # noqa: E731 integer division operation
    __UpperCAmelCase					       =      {
        '''^''': 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(UpperCAmelCase__   ))   )

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

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

            stack.append(
                str(opr[x](int(UpperCAmelCase__   )							, int(UpperCAmelCase__   )   )   )   )  # 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(UpperCAmelCase__   )							, sep=''' | '''							, )

    return int(stack[0]   )


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









def      __lowercase(						UpperCAmelCase__			):


      """simple docstring"""



      if n == 1 or not isinstance(UpperCAmelCase__ , UpperCAmelCase__			):
            return 0
      elif n == 2:
            return 1
      else:
            lowerCamelCase             =		[0, 1]
            for i in range(2 , n + 1			):
                  sequence.append(sequence[i - 1] + sequence[i - 2]			)

            return sequence[n]

def      __lowercase(						UpperCAmelCase__			):


      """simple docstring"""



      lowerCamelCase             =		0
      lowerCamelCase             =		2

      while digits < n:
            index += 1
            lowerCamelCase             =		len(str(fibonacci(UpperCAmelCase__			)			)			)

      return index

def      __lowercase(						UpperCAmelCase__ = 1000			):


      """simple docstring"""



      return fibonacci_digits_index(UpperCAmelCase__			)


if __name__ == "__main__":
     print(solution(int(str(input()).strip())))