URI Online Judge | 2890
# Coloring Tetrahedrons

**Timelimit: 1**

By Paulo E. D. Pinto, UERJ-Universidade do Estado do Rio de Janeiro Brazil

A designer invented a brand for a company in tetrahedron form. He has several colors available to paint and want to know how many different ways a tetrahedron can be colored using any combination of colors on the faces of the same. Note that, if by convenient rotations, the coloring of two tetrahedra match, then it is the same coloration.

Help this designer do this calculation.

Each input line contains an integer **N**, 1 ≤ **N **≤ 10^{4} , the number of colors available. The input ends with a value of 0, which should not be processed.

For each input, print the number of distinct colorings of the tetrahedron with the given number of colors. As the result can be very large, present it as the rest of the division by 1000007.

Input Sample | Output Sample |

1 |
1 |