The Critical Line–Volume 34

The first volume of The Critical Line for 2020 has been submitted by Oliver Chambers.

$$n^2$$ points are laid out in an $$n \times n$$ grid. What is the minimum number of (straight) lines that you need to draw such that every point lies on at least one line, except the point in the bottom left corner which lies on none of the lines? Prove it!