Positions

*Switchin' the positions for you \ Cookin' in the kitchen, and I'm in the bedroom \ I'm in the Olympics, way I'm jumpin' through hoops \ Know my love infinite, nothin' I wouldn't do \ That I won't do, switchin' for you* Chef has an array $A$ consisting of $N$ integers. Chef can swap two elements on positions $i$ and $j$ $(1\le i\lt j \le N)$ only if: - $A_i$ $\&$ $A_j = 0$, where $\&$ denotes t