Two frogs named Gamakachi and Gamatatsu are sitting at the points $(0,0)$ and $(2,0)$ respectively. Their goal is to reach the points $(5,5)$ and $(7,5)$ respectively by making one unit jumps in the positive $x$ or $y$ direction at a time. How many ways can they do this while ensuring that there is no point on the plane where both Gamakichi and Gamatatsu land on?