The NEMO (National Electronic Math Olympiad) is similar to the NIMO Summer Contest, in that there are fifteen problems, each worth a set number of points. However, the NEMO is weighted using Fibonacci numbers; that is, the $n^{\text{th}}$ problem is worth $F_n$ points, where $F_1 = F_2 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \ge 3$. The two problem writers are fair people, so they make sure that each of them is responsible for problems worth an equal number of total points. Compute the number of ways problem writing assignments can be distributed between the two writers.

Let's think step by step and output the final answer within \boxed{}.
user