Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	n, err := strconv.Atoi(nextString())
	return n, err
}

func f(x int) int {
	return x * x
}

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		d, err := nextInt()
		if err != nil {
			break
		}

		area := 0
		for i := 0; i < 600/d; i++ {
			x := i * d
			area += f(x) * d
		}
		fmt.Println(area)
	}
}

C++: #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>

using namespace std;






int main()
{
	long long d;
	while (cin >> d) {
		long long sum = 0;
		for (long long i = 1; i <= (600 / d - 1); i++) {
			sum += i*i*d*d*d;
		}
		cout << sum << endl;
	}
	
	

}

C++: #include <iostream>
int main()
{
  int d;
  while (std::cin >> d) {
    int n = 0, s = 0;
    while (n < 600) {
      s += n * n * d;
      n += d;
    }
    std::cout << s << std::endl;
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n;
  while(cin>>n){
    int sum = 0;
    for(int i=0; i<600; i+=n){sum+=i*i*n;}
    cout<<sum<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int d;
	while(cin>>d){
		int sum=0;
		for(int i=1; i*d<=600-d; i++){
			sum+=(i*d)*(i*d)*d;
		}
		cout<<sum<<endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
	int d;
	long sum;
	int n;

	while(cin >> d){
		sum = 0;
		n = 600 / d;

		for(int i=1;i<n;i++){
			sum += d * d*d*i*i;
		}
		cout << sum << endl;
	}
	return 0;
}

C++: #include <stdio.h>

int main(void) {
  int i, ans = 0, j, n;
  while(scanf("%d", &n) != EOF) {
    ans = 0;
    for(i = 0; i * n < 600; ++i) ans += n * i * i * n * n;
    printf("%d\n", ans);
  }
  return 0;
}

C++: #include <iostream>
using namespace std;


int main()
{
	int d,i;
	long sum;
	while( cin >> d ) {
		sum = 0;
		for( i = 0; i < 600; i += d ) {		
			sum += d * i * i;
		}
		printf("%d\n",sum);

	}
		

	return 0;
}

C++: #include<iostream>

using namespace std;

#define MAX_X 600

int main(void)
{
	int d;
	int s = 0;

	while(1){
		while(1){
			cin >> d;
			if( MAX_X % d == 0 ) break;
		}
		if( cin.eof() ) break;

		for( int i = 0 ; i < MAX_X / d ; i++ )
		{
			int height = ( i * d ) * ( i * d );
			int width = d;
			s += height * width;
		}
		cout << s << endl;
		s = 0;
	}

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
        int d;
        while(cin >> d){ 
                int sum = 0;
                for(int i = 1; i*d < 600; i++){
                        sum += d*(i*d)*(i*d);
                }   
                cout << sum << endl;
        }   
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	long long d;
	while(cin >> d){
		long long ans=0;
		for(int i=0;i<600;i+=d){
			if(i+d<=600){
				ans+=i*i*d;
			}else{
				ans+=i*i*(600-d);
			}
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
const int mod = 1e9 + 7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}

int main() {
    int n;
    while (cin >> n && n > 0) {
        int sum = 0;
        for (int d = n; d < 600; d += n) {
            sum += n * d * d;
        }
        cout << sum << endl;
    }
}

C++: #include <iostream>

int integrateX2(int d) {
	static const int iBegin = 0, iEnd = 600;
	int sum = 0;
	for (int x = iBegin; x < iEnd; x += d) {
		sum += x * x * d;
	}
	return sum;
}

int main() {
	int d;
	while (std::cin >> d) {
		std::cout << integrateX2(d) << '\n';
	}
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<string>
using namespace std;

int main(){
  int d,i,s,t;
  s = 0;
  cin >> d;
  t=600/d;
  for(i=1;i<=600-d;i++){
    s=s+d*i*d;}
  cout << s << endl;
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#define N 600
int f(int x){
    return x*x;
}


int main(void){
        int d,i;
        int sum;    
    while(std::cin>>d){
        sum=0;
        for(int i=d;i<N;i+=d){
            sum+=f(i)*d;
        }
        std::cout<<sum<<std::endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int d;
	while(cin >> d){
		int sum = 0;
		for(int i=1; i*d<600; i++){
			sum+= (i*d)*(i*d)*d;
		}
		cout << sum << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main()
{
  int d;

  while (cin >> d){
    int sum = 0, j = 1;
    for (int i = 1; i * d <= 600 - d; i++){
      sum += i * i * d * d * d;
    }
    cout << sum << endl;
  }
}

C++: #include<iostream>
using namespace std;
typedef long long ll;
int main(){
    ll d,sum=0;
    while(cin >> d){
        sum=0;
        for(int i=1;i<=(600/d)-1;i++){
            sum+=d*(i*d)*(i*d);
        }
        cout << sum << endl;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;

void solve(int n) {
  int ans = 0;
  int high = 0;
  int c = n;
  while(c < 600) {
    high = c * c;
    ans += high * n;
    c += n;
  }
  cout << ans << endl;
}

int main(void) {

  int n;
  while(cin >> n) {
    solve(n);
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main() {
	int d, newd, s = 0;
	while (cin >> d) {
		s = 0;
		newd = d;
		while (newd < 600) {
			s += d * pow(newd, 2);
			newd += d;
		}
		cout << s << endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void){
	int n;
	int sum;
	int i;
	while(1){
		cin>>n;
		if(cin.eof())	break;
		sum=0;
		for(i=n;i<=600;i+=n){
			sum+=n*pow((i-n),2);
		}
		cout<<sum<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int area(int d) {
    int i, x, y, s;
        s = 0;
        x = 600;
        i = 1;
        for(i = 1; d * i <= 600 - d; i++){
            y = (d * i) * (d * i);
            s += d * y;
        }
        
        
    return s;
    }

int main(void){
    int d;
    while(scanf("%d", &d) != EOF) {
       printf("%d\n", area(d));
    }
    return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main(void){
    // Your code here!
    int d, S, i;
    while(scanf("%d" , &d) != EOF){
        S=0;
        for(i=1; i<600/d; i++){
            S = S + d * pow(i * d, 2);
        }
        cout << S << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(void) {
    unsigned d, x, s;
    while(cin >> d) {
        x = 0; s = 0;
        while(x < 600) {
            s += x * x * d;
            x += d;
        }
        cout << s << endl;
    }
}

C++: /*Filename: aoj0014.cpp
 *Author: Mushiyo
 */

#include <iostream>

using namespace std;

int main(){
	int d = 0;

    while(cin >> d){
    	int s = 0;

        for(int i = d; i < 600; i += d){
        	s += d * (i * i);
        }
        
        cout << s << endl;
    }

	return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
    int n;
    while (cin >> n) {
        int d = n;
        long long res = 0;
        while (d < 600) {
            long long y = d * d;
            res += n * y;
            d += n;
        }
        cout << res << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;

int main(void){
	int n;

	while (cin>>n){
		double s=0;
		for (int i=n; i<600; i+=n)
			s += i*i*n;
		cout<<fixed<<setprecision(0)<<s<<endl;
	}
    return 0;
}

C++: #include<iostream>
using namespace std;

int main()
{
 int d;
 while(cin>>d)
 int y=0;
{
for(int i=1; i*d<600; i++)
{
 y+=d*(d*i)*(d*i);
 }
cout<<y<<endl;
}
return 0;
}