Replace 1’s with -1’s and vice versa in a matix

Assume that we have an anti-symmetric matrix that consists of 1’s and -1’s and 0’s. All the elements of the main diameter are 0 and each row and each column has exactly one 1, and one -1. Design an algorithm that replaces all 1’s with -1’s and vice versa only by swapping some rows and some columns.