Go: package main

import "fmt"

func main() {
	var d int
	for {
		fmt.Scan(&d)
		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 d;
  while (cin >> d) {
    int sum = 0;
    for (int i = 0; i < 600 / d; ++i) {
      sum += i * d * i * d * d;
    }
    cout << sum << endl;
  }
  return 0;
}

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

double func(double x){
    return x * x;
}

double rectangle_method(double a, double b, int n) {
  double acc = 0, d = (b - a) / n;
  for (int i = 0; i < n; i++) {
    acc += func(a + i * d) * d;
  }
  return acc;
}

int main(){
    int d;
    while(scanf("%d",&d) != EOF){
        cout << (int)rectangle_method(0, 600, 600/d) << endl;
    }

    return 0;
}

C++: #include <iostream>
using namespace std;
int main() {
  for(int i = 0; i < 20;i++) {
  int d;
  cin >> d;

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

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>

#define EPS (1e-10)
using namespace std;
#define PI (3.1415926535)

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

int main(){
	int d;
	int s;

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

	return 0;
}

C++: /*#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	CI n;
	return;
}


int main(void) {
	input();
	double money = 100000;
	
	for (int i = 0; i < n; i++) {
		money *= 1.05;
	}
	
	if ((int)money % 1000 >= 500) {
		CO (int)(money - ((int)(money) % 1000) + 1000) E
	}
	else {
		CO (int)(money - ((int)(money) % 1000)) E
	}

	

	return 0;
}

*/

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
long long int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	
	return;
}


int main(void) {
	
	int i = 1;
	int sum = 0;
	
	while (scanf("%d",&n) != EOF) {
		while (true) {
			sum += (n * n * (i - 1) * n * (i - 1));
			if ((n * i) == 600)break;
			i++;
		}

		CO sum E
		sum = 0;
		i = 0;
	}
	return 0;
}

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

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

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

C++: #include<cstdio>
//#include<cmath>
 
//#include<iostream>
using namespace std;
 
int main(){
long d, x, S;

	while( scanf("%d" , &d)!= EOF){
		for(S=0, x=0; x<600; x+=d)	S+=(x*x);
 		printf("%d\n",S*d);
	}

    return 0;
}

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

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

C++: #include <iostream>

int main(){
    int d, menseki;
    while(std::cin >> d){
        menseki　=　0;
        for(int x = 0; x < 600; x+=d){
            menseki += d * x * x;
        }
        std::cout << menseki << std::endl;
    }
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>


using namespace std;

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

	return 0;
}

C++: #include <iostream>

inline int get_function(const u_int x)
{
    return x * x;
}

int get_integral(const u_int x, const u_int d)
{
    u_int ans, num_of_iter = x / d;
    for(u_int i = 1; i < num_of_iter; ++i)
        ans += d * get_function(d * i);
    return ans;
}

int main()
{
    const u_int x = 600;
    u_int d;
    while(std::cin >> d)
        std::cout << get_integral(x, d) << std::endl;
    
    return 0;
}

C++: #include <bits/stdc++.h>
  
using namespace std;
  
int main()
{
    int d;
  
    while (~scanf("%d", &d)) {
        int ans = 0;
        for (int a = d; a <= 600 - d; a += d) ans += a * a * d;
        printf("%d\n", ans);
    }
}

C++: #include <bits/stdc++.h>

using namespace std;

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

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

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

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

C++: #include <iostream>

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

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

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

inline int functional(int x){
	return x*x;
}

int main(void){
	int buf;
	int x_max = 600;
	std::vector<int> d;

	while(std::cin >> buf){
		d.push_back(buf);
	}
	
	int sum;
	for(int i = 0; i < (int)d.size(); ++i){
		sum = 0;
		for(int j = 0; j < x_max; j += d[i]){
			sum += d[i]*functional(j);
		}
		std::cout << sum << std::endl;
	}
	return 0;
}

C++: #define _GLIBCXX_DEBUG
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <numeric>

typedef long long ll;

int main(int argc, char* argv[])
{
  ll d;
  while (std::cin >> d) {
    ll ans = 0;
    for (ll x = d; x < 600; x += d) {
      ans += d * x * x;
    }
    std::cout << ans << std::endl;
  }

  return 0;
}