Probability & Statistics · Challenge problem

On a grid, a path moves only right or up along unit steps from $(0,0)$ to $(6,6)$. How many such shortest paths avoid the point $(3,3)$?