Chef Product

Chef has a special interest in studying sets of integers. Given an integer $N$, he defines a *good-set* as a set of **distinct non-negative** integers, such that: - The sum of the integers in the set is equal to $N$. - The product of each non-empty subset of the set is **odd**. Determine the number of **distinct sizes** of *good-set* that can be formed. ### Input - The first line of input will