






def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							if b == 0:
														return 1
							if (b % 2) == 0:
														return actual_power(a  ,					int(b / 2 ) ) * actual_power(a  ,					int(b / 2 ) )
							else:
														return a * actual_power(a  ,					int(b / 2 ) ) * actual_power(a  ,					int(b / 2 ) )

def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							if b < 0:
														return 1 / actual_power(a  ,					a )
							return actual_power(a  ,					a )


if __name__ == "__main__":
	print(power(-2, -3))








def _UpperCAmelCase   (	a						:	int = 1000 ):
							snake_case__  , snake_case__	  =       1, 1
							snake_case__	  =       2
							while True:
														snake_case__	  =       0
														snake_case__	  =       fa + fa
														snake_case__  , snake_case__	  =       fa, f
														index += 1
														for _ in str(a ):
																					i += 1
														if i == n:
																					break
							return index


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