What is the number of ways to choose $60$ unit squares from an $11 \times 11$ chessboard such that no two chosen squares share a common side?

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