# Solution of;
# Project Euler Problem 614: Special partitions 2
# https://projecteuler.net/problem=614
# 
# An integer partition of a number $n$ is a way of writing $n$ as a sum of 
# positive integers. Partitions that differ only by the order of their 
# summands are considered the same. We call an integer partition special if 1) 
# all its summands are distinct, and 2) all its even summands are also 
# divisible by 4. For example, the special partitions of $10$ are: \[10 = 
# 1+4+5=3+7=1+9\]The number $10$ admits many more integer partitions (a total 
# of 42), but only those three are special. Let be $P(n)$ the number of 
# special integer partitions of $n$. You are given that $P(1) = 1$, $P(2) = 
# 0$, $P(3) = 1$, $P(6) = 1$, $P(10)=3$, $P(100) = 37076$ and 
# $P(1000)=3699177285485660336$. Find $\displaystyle \sum_{i=1}^{10^7}{P(i)}$. 
# Give the result modulo $10^9+7$.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 614
    timed.caller(dummy, n, i, prob_id)
