Rachna and Vedansh were sitting in classroom in the break.In the classroom only Rachna and Vedansh were present. Rachna has N number of trophies .

If anybody comes in , she can give him any number of trophies. she don't know how many people will come but it is sure that total number of people is N.but Now she want to distribute Trophies. but she don't want to repeat any distribution ways.

See TestCase for more understanding.

she asks Vedansh to tell that in how many ways , she can distribute the trophies ??

Rachna and Vedansh will always have some amount of trophies.

since answer can be large , print modulo 10000007.

INPUT:

Input consist of single integer N. (use fast Input reader)

OUTPUT:

Output should contain number of ways Rachna can distribute all trophies. (print modulo 10000007)

CONSTRAINTS:

2<=N<=30000

Total Number of Persons<=N