Fermat's little theorem states that for a prime $$$p$$$ and any integer $$$a$$$ such that $$$0 < a < p$$$,

In other words, the powers of $$$a$$$ modulo $$$p$$$ repeat with a period of $$$p-1$$$.

This is further generalized by Euler's theorem which implies the powers of $$$a$$$ repeat with a period of $$$p-1$$$. This can be even further generalized with Lagrange's theorem for groups.

https://www.geeksforgeeks.org/find-abm-where-b-is-very-large/

You can use above link for better understanding.

It can be shown that prime = 2,3,5,7 all works. For every prime > 2,3,5,7 it can be represented by 2,3,5,7, so the answer is 1*1*1*...*1=1.