Row Reduction & Rank · Superchallenge problem

How many $3\times 3$ matrices with every entry equal to $0$ or $1$ can be reduced by Gaussian elimination without row exchanges to an upper triangular matrix with three nonzero pivots (so that $A = LU$ with $L$ unit lower triangular and $U$ invertible upper triangular)?