IMC 2005 — Keystage 3 (IWYMIC) — team Question 7

A frog starts on a square adjacent to a corner square of a $5\times5$ board. Each hop is to a horizontally or vertically adjacent square, never diagonally. Prove it cannot visit every square exactly once.