Even Candy Distribution

Problem Statement:

You are given an integer n. You have 2n indistinguishable candies and n children. Each child must receive an even number of candies. This problem asks you to compute the number of ways to distribute the candies such that every child gets an even number of candies.

Mathematically, the answer is given by the binomial coefficient

$$\binom{2n}{n}$$

computed modulo $$10^9+7$$.

In other words, if you denote the answer by A(n), then

$$A(n) = \binom{2n}{n} \bmod (10^9+7). $$

Constraints: You may assume that 1 ≤ n ≤ 50000. ## inputFormat The input consists of a single integer n on one line, read from standard input. ## outputFormat Output a single integer which is the value of $$\binom{2n}{n}$$ modulo $$10^9+7$$, printed on one line to standard output.## sample

1

2

$$