Udit loves running . Today he is planning to run N meters and he has promised himself that he will take steps of odd meters only. He can take step of any size. Now , he wonders in how many ways he could run N meters by only taking odd metered steps. Order in which udit takes his step matters .

You have to print the answer mod $10^{9}+7$

Input :

First line contains N

Output :

Output Number of distinct ways modulo $10^{9}+7$

Constraints

$1 \le n \le 10^{5}$