Obviously?
As a simple exercise using modulus arithmetic where learners can
make and test their own conjectures. By trying small values of n
learners may make their own conjectures about when the expression
is divisible by 6 and when it is not.
Key question
How can we write the expression as an equivalent expression modulo
3?