Given an $8\times 8$ checkerboard with alternating white and black squares, how many ways are there to choose four black squares and four white squares so that no two of the eight chosen squares are in the same row or column?

[i]Proposed by James Lin.[/i]

Let's think step by step and output the final answer within \boxed{}.
user