Given a binary 2D grid (each element can either be a `1` or a `0`). You have the ability to choose any element and flip its value. The only condition is that when you choose to flip any element at index `(r, c)`, the 4 neighbors of that element also get flipped. Find the minimum number of flips that you need to do in order to set all the elements in the matrix equal to `0`. If it\'s not possible, return `-1`.\n\n**Example 1:**\n```\nInput:\n[[0, 0, 0],\n [0, 0, 0],\n [0, 0, 0]]\n\nOutput: 0\n```\n\n**Example 2:**\n```\nInput:\n[[0, 1, 0],\n [1, 1, 1],\n [0, 1, 0]]\n\nOutput: 1\nExplanation: Flip (1, 1) to make the whole matrix consisting of only 0s.\n```\n\n**Example 3:**\n```\nInput:\n[[0, 1, 0],\n [1, 1, 0],\n [0, 1, 1]]\n\nOutput: 4\nExplanation:\n1. Flip (0, 0)\n[[1, 0, 0],\n [0, 1, 0],\n [0, 1, 1]]\n\n2. Flip (0, 1)\n[[0, 1, 1],\n [0, 0, 0],\n [0, 1, 1]]\n\n3. Flip (0, 2)\n[[0, 0, 0],\n [0, 0, 1],\n [0, 1, 1]]\n\n4. Flip (2, 2)\n[[0, 0, 0],\n [0, 0, 0],\n [0, 0, 0]]\n```

Given a binary 2D grid (each element can either be a 1 or a 0). You have the ability to choose any element and flip its value. The only condition is that when y