Count Lattice Paths in an n × n Grid

Given an n × n grid, you are required to count the number of distinct lattice paths from the top-left corner (0,0) to the bottom-right corner (n,n). In each move, you can only go one step to the right or one step down.

The number of distinct paths is given by the combinatorial formula:

\( \displaystyle {2n \choose n} \)

For example, when n = 2, the number of distinct paths is 6.

inputFormat

The input consists of a single line containing one integer n (0 ≤ n ≤ some reasonable limit), representing the size of the grid.

outputFormat

Output a single integer, which is the number of distinct lattice paths from (0,0) to (n,n).

0

1