TSTST 2017 Problem 6

A sequence of positive integers $\left(a_{n}\right)_{n \geq 1}$ is of Fibonacci type if it satisfies the recursive relation $a_{n+2}=a_{n+1}+a_{n}$ for all $n \geq 1$. Is it possible to partition the set of positive integers into an infinite number of Fibonacci type sequences?