Go: package main

import "fmt"

func main() {
	var d int
	for {
		v, _ := fmt.Scan(&d)
		if v == 0 {
			break
		}
		sum := 0
		for i := 0; i < 600/d; i++ {
			sum += d*d*i*d*i
		}
		fmt.Println(sum)
	}
}

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

int main()
{
	int d;
	while(~scanf("%d",&d)){
		int S=0;
		for(int i=d;i<=600-d;i+=d){
			S += (i*i)*d;
		}
		printf("%d\n",S);
	}
}

C++: #include <iostream>

using namespace std;

int fx(int x)
{
	return x * x;
}


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

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

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

C++: #include<iostream>

using namespace std;

int main() {
  int x,m,n;
	while(cin >> x){
	  n=0;
	  m = 600/x;
	  for(int i = 1;i<m;i++){
	    n += x*x*x*i*i;
	  }

	  cout << n << endl;
	}
	return 0;
}

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

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

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

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

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

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve
ll calc(ll d){
  ll res = 0.0;
  int x = d;
  while(x < 600){
    res += x * x;
    x += d;
  }
  return res * d;
}

int main(int argc, char const* argv[])
{
  int d;
  while(cin >> d){
    cout << calc(d) << endl;
  }
	return 0;
}

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

int main(){
    // y = x^2
    int d, i, s;
    s = 0;
    cin >> d;
    for (i = 0; i < (600/d); ++i){
        s = s + (i * d) * (i * d) * d;
    }
    cout << s << endl;
}

C++: #include <iostream>

using namespace std;

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

C++: #include <stdio.h>

int f(int x);

int main(void){
    int d;
    long s;
	
    while (scanf("%d", &d)){
        s=0;
        for (int i=0; i<600/d; i++){
            s += d*(i*d)*(i*d);
        }
	    printf("%ld\n", s);
    }
    return 0;
}

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

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

int main(){
	int d,s;

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

C++: #include<iostream>

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

C++: #include <iostream>
#include <vector>

template <typename Func, typename Num>
Num integral(Func f, Num begin, Num end, Num d) {
	Num ret = 0;
	for (Num n = begin; n < end; n += d) {
		ret += f(n) * d;
	}
	return ret;
}

int main() {
	int n;
	std::vector<int> ans;
	
	while (std::cin >> n) {
		const int a = integral([](int x){return x*x;}, 0, 600, n);
		ans.push_back(a);
	}
	
	for (auto a : ans) {
		std::cout << a << std::endl;
	}
}

C++: $<.map{|i|a=b=i.to_i;c=0;(600/a-1).times{c+=b*b*a;b+=a};p c}

C++: #include<iostream>

using namespace std;

int main() {
	int d, x, y, s = 0;
	while (cin >> d) {
		x = 600;
		s = 0;
		for (x -= d; x > 0; x -= d) {
			y = x * x;
			s += y * d;
		}
		cout << s << endl;
	}
	return 0;
}

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

C++: #include<iostream>
using namespace std;
typedef long long llong;
llong f(llong x) {
	return x*x;
}
int main() {
	int d;
	while (cin >> d) {
		llong s = 0;
		for (int i = d; i < 600; i += d) {
			s += f(i)*d;
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	for (int i = 0; i < 20; i++){
		int d, s = 0, a;
		cin >> d;
		a = 600 / d;
		for (int j = 1; j < a; j++){
			s = s + d*d*d*j*j;
		}
		cout << s << endl;
	}
	return 0;
}

C++: /*
y = x*xの0 <= x <= 600の積分
ただし横幅dが600の約数の長方形の和で考えるため、精度は低い
*/

#include <iostream>
using namespace std;

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

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

int main()
{
  int in;
  while(cin>>in){
    int number = 600/in;
    int sum = 0;
    for(int i=1; i<number; i++){
      sum += pow(i*in, 2) * in;
    }
    cout << sum << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int d;
    int LuasPersegiPanjang = 0;
    int TinggiPersegiPanjang[600];
    int TinggiSementara;

    while(cin >> d)
    {
        int BanyakPersegiPanjang = 600/d;
        TinggiSementara = d;
        for(int x = 0; x < BanyakPersegiPanjang-1; x++)
        {
            TinggiPersegiPanjang[x] = TinggiSementara*TinggiSementara;
            TinggiSementara = TinggiSementara + d;

            LuasPersegiPanjang = LuasPersegiPanjang + (TinggiPersegiPanjang[x] * d);
        }

        cout << LuasPersegiPanjang;
    }




}

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

int main(int argc, const char * argv[])
{
    int d;
    while (cin >> d) {
        int area = 0;
        int cnt = 0;
        for (int i = 1; i < (600/d); i++) {
            area += d* (d*i) * (d*i);
            cnt++;
        }
        cout << cnt << endl;
        cout << area << endl;
    }
    
    return 0;
}

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

int main()
{
    int n, m;
    double ans = 0;
    cin >> n;
    m = 600 / n;
    for (int i = 0; i < 600; i += n) {
        ans += i * i;
    }
    cout << ans << endl;
    return 0;
}

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

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

C++: <?php  
$r = trim(fgets(STDIN));  
$sum = 0;
for($i = 0; $i < 600; $i+=$r){
	$sum+=($i*$i)*$r;
}
echo $sum;
?>

C++: #include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<complex>
#include<stack>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)


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