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++: #include <iostream>

using namespace std;

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

int main(void){

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

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

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

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

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

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

int main()
{
    int d;

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

    return 0;
}

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

using namespace std;

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

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>

using namespace std;
int f(int);

int main(){

	int x, d;
	long int sum;

	while(cin >> d){
		sum = 0;

		for(int i=1 ; i*d<600 ; i++){
		sum += f(600 - i*d) * d;
		}

		cout << sum << endl;
	}

	return 0;
}

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

C++: #include<cstdio>

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

C++: #include <iostream>

using namespace std;

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

int main(void){
	int d;
	while(cin >> d){
		int s=0;
		for(int i=0;i<600;i+=d){
			s += f(i)*d;
		}
		cout << s <<"\n";
	}
	return 0;
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

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

void solve() {
	int p;
	while(cin >> p) {
		int acc = 0;
		rep(i, 600 / p - 1) acc += f(p * (i + 1)) * p;
		cout << acc << endl;
	}
}

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

int i,c;

int area(int d) {
    int sum = 0;
    for(i=d; i<=600-d;i += d){
        c = d * i * i;
        sum = sum + c;
        
    }
    return sum;
}

int main(void){
    int d;
    while(cin >> d) {
       cout << area(d) << endl;
    }
    return 0;
}

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

C++: #include <cstdlib>
#include <iostream>
#include <string>

using namespace std;

int approx(int d) {
  int acc = 0;
  for (int x = 0; x < 600; x += d) {
    acc += x * x * d;
  }
  return acc;
}

int main() {
  string line;
  while (getline(cin, line)) {
    int d = atoi(line.c_str());
    cout << approx(d) << endl;
  }

  return 0;
}

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

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


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

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

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

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

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

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <sstream>
using namespace std;

#define REP(i,a,n) for(int i=(a);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()

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

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

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

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

int main()
{
	int x=600, d;

	while(cin>>d){
		int n=x/d;
		//cout<<"n="<<n<<endl;
		long sum=0; //d^2+(2d)^2+(3d)^2+...
		for(int i=0;i<n;++i){
			sum+=((i*d)*(i*d));
			//cout<<sum<<endl;
		}
		cout<<sum*d<<endl;
	}
	return 0;
}

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

using namespace std;

int main(void) {
	while(1) {
		int d;
		int sum = 0;
		cin >> d;
		if( cin.eof() )		break;
		int f = 600 - d;
		for(int i = d; i <= f; i += d) {
			sum += (i * i) * d;
		}
		
		cout << sum << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int d;

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

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;

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

	return 0;
}

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

int get_square(int x){
  return x*x;
}
int main(){
  vector<int> area_anss;
  int d;
  while(cin>>d){
  int area=0;
  for(int i=1;i<600/d;i++){
    area=area+get_square(i*d)*d;
    }
  area_anss.push_back(area);
  }
  for(int i=0;i<area_anss.size();i++){
    cout<<area_anss[i]<<endl;
  }
}

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

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

int main(void)
{
	int n;

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

		for(int i = 1; i * n < 600; i++)
			s += f(i * n) * n;

		cout << s << endl;
	}

	return 0;
}