All possible combinations of n*n Matrix

A=[1 1 1 1 1;
   0 0 0 0 0;
   0 0 0 0 0;
   0 0 0 0 0;
   0 0 0 0 0]

I want to store all possible combinations/permutations of Matrix A.

Please Help

[Matt J]

That's doubtful. A lower bound on the memory it would require to store factorial(25) permutations of anything is 4.4194e+09 GB.