Challenge: nth Post-order

Problem

Given a binary tree, print the value of nodes that will be at the $n^{th}$ index when the tree is traversed in post-order.

Input

An integer index.

Output

Display the value of the node at the given index in post-order traversal.

Sample input

index = 5

Sample output

5

Let’s look at the illustration to better understanding the problem.