given a binary string s having length N*N. N is even.number of 1s in the string is equal to number of 0s in the string.you have to rearrange the string in the minimum possible swaps to make the string satisfy the following conditions,

1.if (i+1)%N — i%N =1 then s[i]+s[i+1] =1

2.if i+N < N*N then s[i]+s[i+N]=1

there are T test cases. 1<=T<=100 2<=N<=1000