






"""simple docstring"""


import operator as op



def 					lowerCAmelCase				(    __UpperCamelCase ):




  """simple docstring"""







  __A									= []
  __A									= lambda __UpperCamelCase		,       __UpperCamelCase : 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(__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:
      __A									= stack.pop()  # pop stack
      # output in tabular format
      print(''''''.rjust(8 )		,       ('''pop(''' + b + ''')''').ljust(1_2 )		,       ''','''.join(__UpperCamelCase )		,       sep=''' | ''' )

      __A									= 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__":
       lowercase_				     =     input('\n\nEnter a Postfix Equation (space separated) = ').split(' ')
       print('\n\tResult = ', solve(Postfix))












"""simple docstring"""


from collections import defaultdict
from math import ceil, sqrt



def 					lowerCAmelCase				(    __UpperCamelCase = 1_0_0_0_0_0_0		,       __UpperCamelCase = 1_0 ):




  """simple docstring"""







  __A									= defaultdict(__UpperCamelCase )

  for outer_width in range(3		,       (t_limit // 4) + 2 ):
    if outer_width * outer_width > t_limit:
      __A									= max(
          ceil(sqrt(outer_width * outer_width - t_limit ) )		,       1 )
    else:
      __A									= 1

    hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

    for hole_width in range(__UpperCamelCase		,       outer_width - 1		,       2 ):
      count[outer_width * outer_width - hole_width * hole_width] += 1

  return sum(1 for n in count.values() if 1 <= n <= 1_0 )


if __name__ == "__main__":
       print(F'''{solution() = }''')




