#Lutece1859. Smothered

Smothered

Migrated from Lutece 1859 Smothered

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Calculate

x1=1Nx2=x1Nx3=x2Nx4=x3N(Nx1)(Nx2)(Nx3)(Nx4)mod  109+7\sum_{x1=1}^{N}\sum_{x2=x1}^N\sum_{x3=x2}^N\sum_{x4=x3}^N(N-x1)\cdot(N-x2)\cdot(N-x3)\cdot(N-x4) \mod 10^9 + 7

Input

The first line contains a postive integer NN (1N666).(1 \leq N \leq 666).

Output

Print the corresponding answer in a single line.

Samples

输入数据 1

5

输出数据 1

1701

输入数据 2

10

输出数据 2

359502

输入数据 3

15

输出数据 3

8408778

Resources

The 16th UESTC Programming Contest Preliminary