What a Proof Is · Hard problem

A proof contains the step "$6 \mid n$ and $9 \mid n$, so $54 \mid n$". What is the smallest positive integer $n$ showing the step is invalid?