Code Submission Evaluation System Login

CSES Problem Set

Two Sets II


Task | Statistics


CSES - Two Sets II

Time limit:1.00 s Memory limit:512 MB

Your task is to count the number of ways numbers $1,2,\ldots,n$ can be divided into two sets so that the sums of the sets are equal.

For example, if $n=7$, there are four solutions:
Input

The only input line contains an integer $n$.

Output

Print the answer modulo $10^9+7$.

Constraints
Example

Input:
7

Output:
4