Go: package main

import (
        "fmt"
)

func main() {
        var n int
        for {
                _, err := fmt.Scanf("%d", &n)
                if err != nil {
                        break
                }
                area := 0
                for i := n; i < 600; i += n {
                        area += i*i * n
                }
                fmt.Printf("%d\n", area)
        }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;

int main(){
	ll d, s = 0;
	while (cin >> d){
		REP(i, 600 / d - 1){
			s += pow((i + 1)*d, 2)*d;
		}
		cout << s << "\n";
		s = 0;
	}
	return 0;
}

C++: #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <functional>
#include <string>
#include <queue>
#include <vector>

using namespace std;

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

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

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

int main(){
	int d;
	while(cin>>d){
		unsigned int S=0;
		for(int i=0;i<WIDTH;i+=d){
			S+=func(i,d);
		}
		cout<<S<<endl;
	}

}

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

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

C++: #include <iostream>


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

double integral(double h, double min_x = 0, double max_x = 600) {
    double sum = 0;
    for (double x = min_x; x < max_x; x+= h) {
        sum += func(x) * h;
    }
    return sum;
}

int main()
{
    int input;
    while(std::cin >> input) {
        std::cout << (int)integral(input) << std::endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for (int i=n;^i;i--)
#define ALL(v) v.begin(),v.end()
// #define int ll 
#define eps 1e-9
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))

template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
typedef long long ll;

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

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

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;
	}
}