A circle with a diameter of 2n-1 is symmetrically drawn on a chessboard of 2nx2n cells. Through how many squares of the board does this circle pass and how many squares will fit completely inside this circle? E.g if n = 4, then answer is, completely inside: 4, pass: 12;