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>
using namespace std;

int main() {
	int n;
	int h;
	long s=0;
	while(cin>>n){
		for(h=n;h<600;h+=n){
			s+=h*h*n;
		}
		cout<<s<<endl;
		s=0;
	}
	// your code goes here
	return 0;
}

C++: #include<stdio.h>
#include<math.h>
int f(int);

int main(void){
    int a=0, b=600, x,d;
    int n,i;
    int s,sum;
    scanf("%d　%d", &d,&d);
    n=(b-a)/d;
    
    sum=0.0;
    x=a;
    for(i=1; i<=n; i++){
        s=d*f(x);
        x+=d;
        sum+=s;
    }
    printf("%d\n", sum);
}
int f(int x){
    return x*x;
}

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

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

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

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

C++: #include <vector>
#include <iostream>
#include <valarray>
#include <string>
#include <algorithm>
#include <set>
#include <cstdio>
typedef unsigned long long ull;
typedef long long ll;
#define fst first
#define snd second
#define rep(i,n) for(ull i = 0;i<(n);i++)
#define rep1(i,n) for(ull i = 1;i<=(n);i++)
#define revrep(i,n) for(ull i = (n-1);i>=0;i--)
#define all(n) (n).begin(),(n).end()
#define show(x) cout << "debug " << #x << ":" << x << endl;
#define showvec(x) cout << endl << "debug " << #x << ";" << endl; \
    for(ull __i = 0;__i < x.size();__i++){ \
        for(ull __j = 0;__j<x[0].size();__j++){ \
            cout << x[__i][__j] << " "; \
        } \
        cout << endl; \
    } \
    cout << endl;
using namespace std;

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

int main(){
	int d;
	while(~scanf("%d\n",&d)){
		ll sum = 0;
		for(int x = d;x <= 600 - d; x += d){
			sum += d * f(x);
		}
		cout << sum << endl;
	}
}

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

int main() {
	int d,a;
	a = 0;
	while(cin >> d){
		for(int i = 0;i!=600;i+=d){
			a += i*i*d;

		}
		cout << a << endl;
		a = 0;
	}

	


	return 0;
}

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

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

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

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

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

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

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

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

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

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

void solve(int delta_x){
	int number_of_rectangle, height_of_rectangle;
	int integer = 0;
	number_of_rectangle = 600 / delta_x;
	for(int i = 1;i < number_of_rectangle;i++){
		height_of_rectangle = (delta_x * i) * (delta_x * i);
		integer += height_of_rectangle * delta_x;
	}
	cout << integer << endl;
}

int main(){
	int number_of_rectangle, delta_x;
	while(cin >> delta_x){
		solve(delta_x);
	}
	return 0;
}

C++: //50
#include<iostream>

#define S(X) ((X)*(X))

using namespace std;

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

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

C++: #include<iostream>
int main(){
	while(1){
		int d,s=0;
		std::cin>>d;
		if(std::cin.eof())break;
		for(int i=0;i<600;i+=d)s+=i*i*d;
		std::cout<<s<<std::endl;
	}
	return 0;
}

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

int f(int x)
{
    return x * x;
}
int main()
{
    while(true){
        int d;
        std::cin >> d;
        if(std::cin.eof()) break;
        
        int s = 0;
        for(int x = d; x < 600; x += d){
            s += d * f(x);
        }
        std::cout << s << std::endl;;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;


unsigned long long  f(unsigned long long x)
{
    return x*x;
}

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

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

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

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

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

C++: #include <iostream>

using namespace std;

int main()
{
    int d;
    int Answer = 0;

    while(cin >> d)
    {
        for(int i = d; i < 600; i+=d)
        {
            Answer = Answer + i*i*d;
        }

        cout << Answer;
    }

}

C++: #include<algorithm>
#include<cassert>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << endl

constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-8;

const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

template<typename T>
bool chmax(T &a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool chmin(T &a, T b){
    if(b < a){
        a = b;
        return true;
    }
    return false;
}

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

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

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

    return 0;
}

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

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

int main(void)
{
  int a=0, i, d;

  scanf("%d", &d);

  for(i=1; i < 600/d; i++)
  {
    a = d * f(d*i) + a;
  }

  printf("%d", a);

  return 0;
}