Maximum in Table【穷举法】

Maximum in Table

An n × n table a is defined as follows:

• The first row and the first column contain ones, that is: ai, 1 = a1, i = 1 for all i = 1, 2, ..., n.
• Each of the remaining numbers in the table is equal to the sum of the number above it and the number to the left of it. In other words, the remaining elements are defined by the formula ai, j = ai - 1, j + ai, j - 1.

These conditions define all the values in the table.

You are given a number n. You need to determine the maximum value in the n × n table defined by the rules above.

Input

The only line of input contains a positive integer n (1 ≤ n ≤ 10) — the number of rows and columns of the table.

Output

Print a single line containing a positive integer m — the maximum value in the table.

Examples

Input

1

Output

1

Input

5

Output

70

Note

In the second test the rows of the table look as follows:

{1, 1, 1, 1, 1}, 

{1, 2, 3, 4, 5}, 

{1, 3, 6, 10, 15}, 

{1, 4, 10, 20, 35}, 

{1, 5, 15, 35, 70}.

问题链接：https://vjudge.net/problem/CodeForces-509A

问题分析：输入一个数n，形成n*n个数，每一个数为这个数的上面和左边的数之和，输出其中最大的一个数

看题意可以知道，n<=10&&n>=0,由于n的范围很小，所以可以用穷举法，算出n所对应的最大值。

AC代码：

#include<iostream>
using namespace std;
int main() 
{
	int a[10];
	int n;
	cin >> n;
	a[0] = 1;a[1] = 2;a[2] = 6;a[3] = 20;a[4] = 70;
	a[5] = 252;a[6] = 924;a[7] = 3432;a[8] = 12870;a[9] = 48620;
	cout << a[n - 1];
	
}