Calculate S(n)

Problem Description

Calculate S(n).

S(n)=1³+2³ +3³ +......+n³ .

 

Input

Each line will contain one integer N(1 < n < 1000000000). Process to end of file.

 

Output

For each case, output the last four dights of S(N) in one line.

 

Sample Input

1

2

 

Sample Output

0001

0009

 

#include <stdio.h>   // 运用数学公式：1^3 +2^3 +3^3 +……+n^3 =[n(n+1)/2]^2

int main(){
    int n;
    int result;

    while(scanf("%d",&n)!=EOF){    
        n=n%10000;
        result=(n*(n+1)/2)%10000;
        result=(result*result)%10000;
        
        printf("%04d
",result);
    }
    
    return 0;
}