A pack of $2003$ circus flees are deployed by their circus trainer, named Gogu, on a sufficiently large table, in such a way that they are not all lying on the same line. He now wants to get his Ph.D. in fleas training, so Gogu has thought the fleas the following trick: we chooses two fleas and tells one of them to jump over the other one, such that any flea jumps as far as twice the initial distance between him and the flea over which he is jumping. The Ph.D. circus committee has but only one task to Gogu: he has to make the his flees gather around on the table such that every flea represents a vertex of a convex polygon. Can Gogu get his Ph.D., no matter of how the fleas were deployed?