Mr. Cai is doing some research for numbers now. Those numbers are from 1 to N.
But what's terrible - the Disruptive TT is comming!
She turns all the odd numbers to negative. You see, how naughty TT is.
To punish TT, Mr. Cai decided to give her a task.
TT must put the numbers into two sets and make the sum of the two sets equivalent.
TT knows that she is so piteously. So she ask you to help her find the solutions or she will be spanked.

This problem contains several cases.
Each case is an integer N which is mentioned before. (2 <= N <= 500)

You should output the number of solutions. The answer should mod 1000000007.