Shortest Bridge

A binary grid contains exactly two islands (groups of 4-connected 1s). Print the minimum number of 0s that must be flipped to connect the two islands.

2 <= n <= 100