Count Brackets

easy
1. You are given a number n, representing the number of opening brackets ( and closing brackets )
2. You are required to find the number of ways in which you can arrange the brackets if the closing brackets should never exceed opening brackets
e.g.
for 1, answer is 1 -> ()
for 2, answer is 2 -> ()(), (())
for 3, asnwer is 5 -> ()()(), () (()), (())(), (()()), ((()))

Input Format

A number n

Output Format

A number representing the number of ways in which you can arrange the brackets if the closing brackets should never exceed opening brackets

Constraints

0 <= n <= 15

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
4
Output
14
Previous
Count Of Valleys And Mountains
Next
Optimal Binary Search Tree

Related Questions