Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	for sc.Scan() {
		d, _ := strconv.Atoi(sc.Text())
		var area int
		for i := 1; i*d < 600; i++ {
			area += d * (d * i) * (d * i)
		}
		fmt.Println(area)
	}
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-5)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H &b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H &b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H &b) const { return x == b.x&&y == b.y; }
	bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P &b) const { return cost < b.cost; }
	bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E &b) const { return cost < b.cost; }
	bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
class Vec2 {
public:
	ld x, y;
	Vec2() { x = 0, y = 0; }
	Vec2(ld x, ld y) :x(x), y(y) {}
	ld length() {
		return sqrt(x*x + y * y);
	}
	void normal() {
		ld len = this->length();
		if (len == 0) return;
		x /= len, y /= len;
	}
	Vec2 operator+(Vec2 vec) {
		return Vec2(x + vec.x, y + vec.y);
	}
	Vec2 operator-(Vec2 vec) {
		return Vec2(x - vec.x, y - vec.y);
	}
	Vec2 operator*(int cons) {
		return Vec2(x*cons, y*cons);
	}
	ld operator*(Vec2 vec) {
		return x * vec.x + y * vec.y;
	}
	ld operator%(Vec2 vec) {
		return x * vec.y - y * vec.x;
	}
};
ld dot(Vec2 a, Vec2 b) {
	return a.x*b.x + a.y*b.y;
}
ld cross(Vec2 a, Vec2 b) {
	return a.x*b.y - a.y*b.x;
}
ld areaIntegral(Vec2 a, Vec2 b) {
	return abs(a.x*b.y - a.y*b.x) / 2.0;
}
class Vec3 {
public:
	ld x, y, z;
	Vec3() { x = 0, y = 0, z = 0; }
	Vec3(ld x, ld y, ld z) :x(x), y(y), z(z) {}
	ld length() {
		return sqrt(x*x + y * y + z * z);
	}
	void normal() {
		ld len = this->length();
		if (len == 0) return;
		x /= len, y /= len, z /= len;
	}
	Vec3 operator+(Vec3 vec) {
		return Vec3(x + vec.x, y + vec.y, z + vec.z);
	}
	Vec3 operator-(Vec3 vec) {
		return Vec3(x - vec.x, y - vec.y, z - vec.z);
	}
	Vec3 operator*(int cons) {
		return Vec3(x*cons, y*cons, z*cons);
	}
	ld operator*(Vec3 vec) {
		return x * vec.x + y * vec.y + z * vec.z;
	}
};
ld dot(Vec3 a, Vec3 b) {
	return a.x*b.x + a.y*b.y + a.z*b.z;
}
class Line {
public:
	Vec2 from, to;
	Line(Vec2 from, Vec2 to) :from(from), to(to) {}
};
Line getPerpendicularBisector(Line line) {
	int cx = (line.from.x + line.to.x) / 2, cy = (line.from.y + line.to.y) / 2;
	Vec2 p = Vec2(cx + (line.from.y - line.to.y), cy + (line.to.x - line.from.x));
	return Line(Vec2(cx, cy), p);
}
signed main() {
	int d;
	stack<int>st;
	while (cin >> d) {
		int ans = 0;
		for (int i = 0; i < 600; i += d) {
			ans += i * i*d;
		}
		cout << ans << endl;
	}
}

C++: #include<iostream>
#include<string>
#include<stdio.h>
#include<cctype>
#include<algorithm>
#include<climits>
#include<cmath>
#include<map>
#include<vector>
#define INF INT_MAX
using namespace std;

int d, s;

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


	return 0;
}

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

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

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

	return 0;
}

C++: #include <stdio.h>

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

C++: #include<iostream>

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

C++: #include<iostream>

using namespace std;

int main(void){
  int d;

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

  retu

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

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

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>

#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)


using namespace std;


int main(void)
{
    int number;
    long long answer[21] = {0};
    int i = 0;
    long long sum = 0;
    int x;
    while (cin >> number)
    {
        x = (600 / number);
        REP(k, x)
        {
            sum+= (k*number)*(k*number)*(number);
        }
        //cout << tempsum << endl;
        answer[i] = sum;
        sum = 0;
        i++;
    }
    REP(j, i)
    cout << answer[j] << endl;
    return 0;
}

C++: import sys

a = []
for line in sys.stdin:
    a.append(line)

for n in a:
    num=int(n)
    x=0
    are=0
    while x<600:
         are+=(x**2)*num
         x+=num

print area

C++: #include<iostream>
using namespace std;
int n;
int a[1000000];
int sum[1000000];
int main(int argc, char const *argv[])
{

	int d;
	int ans ;
	cin>>d;
	while (d!=EOF)
	{
		ans =0;
		for (int i = d; i <= 600;i+=d )
		{
			ans += d*(i-d)*(i-d);
		}
		cout<<ans;
	}
	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>
#include <vector>

using namespace std;

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

C++: #include <iostream>

using namespace std;

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

int main()
{
	solve();
	return(0);
}

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

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

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