Lily has a $300\times 300$ grid of squares. She now removes $100\times 100$ squares from each of the four corners and colors each of the remaining $50000$ squares black and white. Given that no $2\times 2$ square is colored in a checkerboard pattern, find the maximum possible number of (unordered) pairs of squares such that one is black, one is white and the squares share an edge.