Number Of Ways Of Triangulation

easy

Dynamic Programming

Question Solve Solutions

1. You are given a number N, which represents the number of sides in a polygon.
2. You have to find the total number of ways in which the given polygon can be triangulated.

Input Format

A number N

Output Format

A number representing number of ways of traingulating a N-sided polygon.

Constraints

1 <= N <= 15

Example

Input

Output

Maximum Sum Of M Non-overlapping Subarrays

Related Questions

easy Super Ugly Number easy Burst Balloons easy Cherry Pickup easy Regular Expression Matching easy Rod Cutting easy Russian Doll Envelopes easy Scramble String easy Temple Offerings easy Word Break easy Optimal Strategy For A Game easy Longest Bitonic Subsequence easy Count Palindromic Subsequences easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations