this could be a construction question but is probably better (more accurately) done with a computer
start with any three points
start anywhere and jump ('leapfrog') over A - the same distance the other side of it (i.e. reflect in the point 'Geogebra' enables you to do this)
then, from where you end up, jump over B
and then C
keep on jumping, over A then B then C
James Tanton explains what happens with this problem, using (kind of) vectors
how can you return to the start after just one 'cycle' - set of three jumps?