OLYMPIC-REVENGE 2018 Problem 1

Let $(F_{n})_{n\geq1}$ the Fibonacci sequence. Find all $n \in \mathbb{N}$ such that for every $k=0,1,...,F_{n}$ $${F_{n}\choose k} \equiv (-1)^{k} \ (mod \ F_{n}+1)$$