Two Equal Sets
Given a positive integer n, count the number of ways to divide the numbers 1, 2, ..., n into two sets of equal sum.
Input
The only input line contains an integer n (1 ≤ n ≤ 500).
Output
Print the answer modulo .
Examples
Input | Output |
|---|---|
7 | 4 |
10 | 0 |
Constraints
Time limit: 20 seconds
Memory limit: 512 MB
Output limit: 1 MB