You are provided an integer that denotes the number of nodes that are available in the tree. Every node contains a value that lies between to and no two nodes contain the same value.
You are required to count all the possible ways to construct a special binary tree of nodes. A special binary tree is a binary tree that contains the following properties:
Input format
Output format
For each test case, print the number of possible ways to create the special binary tree modulo . Print the output in a new line.
Constraints
For the first testcase there are only possible cases which are as follows:
Similarly for the second test case there are possible ways to make the magic binary tree.