Fermat, Euler and Wilson · Easy problem

Fermat's Little Theorem in the form $a^p \equiv a \pmod p$ holds for every integer $a$ when $p$ is prime. Use it to find the remainder when $2^{13}$ is divided by $13$.