# Neo would get lost in this Matrix

**Number Theory**Level 5

Let \(N\) be the number of \(2015\) by \(2015\) matrices in which each entry is either a \(0\) or a \(1\) and each row and column contains an odd number of \(1\)'s.

What is \((\log_{2} N) \pmod{1000}\)?