Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	area := 0
	for sc.Scan() {
		n, _ := strconv.Atoi(sc.Text())
		area = 0

		for i := 1; i < 600/n; i++ {
			area += n * (n * i) * (n * i)
		}

		fmt.Println(area)

	}
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	int n;
	while(cin>>n){
		int sum=0;
		rep(i,600/n)sum+=n*n*n*i*i;
		cout<<sum<<endl;
	}
}

C++: #include<iostream>



using namespace std;

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

int main(){

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

C++: #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#define rep(i,a,n) for(int i=a;i<n;i++)
using namespace std;

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

C++: while (a=c=gets.to_i)>0
b=0
(600/a-1).times{b+=c*c*a;c+=a}
puts b
end

C++: #include <iostream>

using namespace std;

int main(){
	double d;

	while(cin >> d){
	double sum = 0;
	for(int i=1; i*d<600; i++){
	sum = sum + d * (i*d)*(i*d);
	}
	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>
#include<cfloat>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define EPS (1e-10)
using namespace std;

typedef unsigned int uint;
typedef long long ll;
typedef complex<double> P;

#define PI (3.1415926535)
#define EPS (1e-10)

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

C++: #include <iostream>

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

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

C++: #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define INF LLONG_MAX - 100
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define int long long
#define yorn(f) puts((f)?"Yes":"No")
#define YORN(f) puts((f)?"YES":"NO")
#define lowb lower_bound
#define upb upper_bound
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> pque;
int gcd(int a,int b){return b?gcd(b,a%b):a;};
int lcm(int a,int b){return a/gcd(a,b)*b;};
int mod(int a,int b){return (a+b-1)/b;};
int month[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
template<typename A, size_t N, typename T>
void Fill(A(&array)[N],const T &val){std::fill((T*)array,(T*)(array+N),val);}
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;};
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;};



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

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

C++: #include <iostream>

u_int getArea(u_int d){
  u_int area = 0;
  for(u_int i = d; i <= 600 - d; i += d)
    area += i * i * d;
  return area;
}


int main(){
  u_int d;

  while(std::cin >> d)
    std::cout << getArea(d) << std::endl;

  return 0;
}

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

using namespace std;

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

C++: #include<iostream>

using namespace std;

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

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

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

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

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

int main(){
	int d, ans, n;
	while(cin >> d){
		ans = pow(d, 3);
		n = 600 / d - 1;
		ans *= n*(n+1)*(2*n+1) / 6;
		cout << ans << endl;
	}
	return 0; 
}

C++: #include "bits/stdc++.h"

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

using LL = long long int;
using LD = long double;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

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

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }

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

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

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

using namespace std;

int main(){
	int x, y, n, area;
	int d;
	y = 600;
	area = 0;
	while (cin >> d){
		n = y / d;
		for (int i = 1; i < n; i++){
			area += d * ((d * i) * (d * i));

		}
		cout << area << endl;
		area = 0;
	}
	return 0;
}

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

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

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

	return 0;
}

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

int main()
{
    int n;
    vector<int> r;
    while (scanf("%d",&n) != EOF)
    {
	int sum=0;
	for (int i=n; i<600; i+=n)
	{
	    sum+=i*i*n;
	}
	r.push_back(sum);
    }
    for (int i=0; i<r.size(); i++)
    {
	cout << r[i] << endl;
    }
    return 0;
}