We will rely on Fermat's Little Theorem.
If p|n there is nothing to prove.
We will assume that p doth not divide n.
That is, prove 2,3,5,7,13 divide n^12-1
First, the case p=2 is trivial.
If p=3 then,
Raise both to the power of 6,
If p=5 then,
Raise both to the power of 3,
If p=7 then,
Raise both to the power of 2,
If p=13 then,