# Cube

Problem Description
Cowl is good at solving math problems. One day a friend asked him such a question: You are given a cube whose edge length is N, it is cut by the planes that was paralleled to its side planes into N * N * N unit cubes. Two unit cubes may have no common points or two common points or four common points. Your job is to calculate how many pairs of unit cubes that have no more than two common points.

Process to the end of file.

Input
There will be many test cases. Each test case will only give the edge length N of a cube in one line. N is a positive integer(1<=N<=30).

Output
For each test case, you should output the number of pairs that was described above in one line.

Sample Input
1 2 3

Sample Output
0 16 297
Hint
Hint
The results will not exceed int type.

Author
Gao Bo

Source

Recommend
Ignatius.L

n^3块小方块，从中选出2块
)（只有两个小方块之间才存在公共点，我们从所有的小方块中任意选出两个，自然就确定了这两个小方块的公共点的对数，从所有小方块中任意选取两个，总得选取方法数就是所有种类对数数目的总和！） #include<iostream>
using namespace std;

int main()
{
int num,sum;
while(scanf("%d",&num)!=EOF)
{
sum=num*num*num*(num*num*num-1)/2-3*num*num*(num-1);
cout<<sum<<endl;
}
return 0;
}  