TSTST 2021 Problem 7

Let $M$ be a finite set of lattice points and $n$ be a positive integer. A mine-avoiding path is a path of lattice points with length $n$, beginning at $(0,0)$ and ending at a point on the line $x+y=n$, that does not contain any point in $M$. Prove that if there exists a mine-avoiding path, then there exist at least $2^{n-|M|}$ mine-avoiding paths.