


class 			_a				:

							def __init__(				self:      Tuple       ,		UpperCamelCase_:      Dict				)     ->  List[str]:





									"""simple docstring"""







									lowercase__				= val
									lowercase__				= None
									lowercase__				= None


							def  lowerCamelCase_					(				self:      Any       ,		UpperCamelCase_:      Any				)     ->  Union[str, Any]:





									"""simple docstring"""







									if self.val:
											if val < self.val:
													if self.left is None:
															lowercase__				= Node(UpperCamelCase_				)
													else:
															self.left.insert(UpperCamelCase_				)
											elif val > self.val:
													if self.right is None:
															lowercase__				= Node(UpperCamelCase_				)
													else:
															self.right.insert(UpperCamelCase_				)
									else:
											lowercase__				= val
def      _a					( SCREAMING_SNAKE_CASE		,							SCREAMING_SNAKE_CASE	):


		"""simple docstring"""




		if root:
				inorder(root.left		,							SCREAMING_SNAKE_CASE	)
				res.append(root.val	)
				inorder(root.right		,							SCREAMING_SNAKE_CASE	)
def      _a					( SCREAMING_SNAKE_CASE	):


		"""simple docstring"""




		if len(SCREAMING_SNAKE_CASE	) == 0:
				return arr
		lowercase__				= Node(arr[0]	)
		for i in range(1		,							len(SCREAMING_SNAKE_CASE	)	):
				root.insert(arr[i]	)
		# Traverse BST in order.
		lowercase__				= []
		inorder(SCREAMING_SNAKE_CASE		,							SCREAMING_SNAKE_CASE	)
		return res


if __name__ == "__main__":
			print(tree_sort([10, 1, 3, 2, 9, 14, 13]))





def    __lowerCamelCase      (					UpperCamelCase__ = 1000 ):







							'''simple docstring'''






							snake_case_     							=       2**power
							snake_case_     							=       0
							while n:
														snake_case_							,       snake_case_     							=       r + n % 10, n // 10
							return r


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




