





def     A_      (	)      ->    str:
       _snake_case   :				Any  					=    []
       _snake_case   :				Union[str, Any]  					=    1

       while len(lowercase__	) < 1E6:
              constant.append(str(lowercase__	)	)
              i += 1

       _snake_case   :				Optional[int]  					=    "".join(lowercase__	)

       return (
           int(constant[0]	)
           * int(constant[9]	)
           * int(constant[99]	)
           * int(constant[999]	)
           * int(constant[9999]	)
           * int(constant[99999]	)
           * int(constant[999999]	)
       )


if __name__ == "__main__":
   print(solution())








'''simple docstring'''





import operator as op







def snake_case_     (					lowercase__		):
  UpperCAmelCase__      :					Optional[Any]				       =							[]
  UpperCAmelCase__      :					Any				       =							lambda lowercase__   ,       lowercase__		: int(x / y		)  # noqa: E731 integer division operation
  UpperCAmelCase__      :					Any				       =							{
      "^": 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(lowercase__		))		)

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

      UpperCAmelCase__      :					List[Any]				       =							stack.pop()  # pop stack
      # output in tabular format
      print("".rjust(8		)   ,       ("pop(" + a + ")").ljust(1_2		)   ,       ",".join(lowercase__		)   ,       sep=" | "		)

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

  return int(stack[0]		)


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



