# This Is Why We Code

Let $$\phi(n)$$ denote the Euler's totient function.

There exists only one positive integer $$a \le 10^{10}$$ such that $\phi(a)=\phi(a+1)=\phi(a+2).$

Find the remainder when that number $$a$$ is divided by 1729.

×