you give array length n consist zero onesyou perform follow operation multiple time the operation consist step choose integer 1 le x y z le n form arithmetic progression y x z y Flip value a_x a_y a_z ie change 1 0 change 0 1 determine possible element array equal zero if yes print operation lead allzero state your solution contain lfloor fracn3 rfloor 12 operation here lfloor q rfloor denote number q round we possible element equal zero number operation possible