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 <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

double dot(P a,P b){return real(conj(a)*b);};
double cross(P a,P b){return imag(conj(a)*b);};

int main(){
  int d;
  while(~scanf("%d",&d)){
    ll sum = 0;
    REPR(i,600/d){
      sum += i*d*i*d*d;
    }
    cout<<sum<<endl;
  }
  return 0;
}

C++: #include<iostream>

//dがxの約数かどうか判定する関数
bool isDivisor(int d, int x);

int main(){
	const int x = 600;
	int d;
	
	while(std::cin >> d){
		//dがxの約数でなければエラー
		if(!isDivisor(d, x)){
			std::cout << "error" << std::endl;
			return 1;
		}
		
		int sum = 0; //面積の合計値
		for(int i = d; i < x; i += d){
			sum += i*i*d;
		}
		
		std::cout << sum << std::endl;
	}
	
	return 0;
}

bool isDivisor(int d, int x){
	for(int i = 1; i*i < x; ++i){
		if(x%i == 0){
			if(d == i) return true;
			else if(d == x/i) return true;
		}
	}
	return false;
}

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

int main()
{
	int d;
	while(cin>>d)
	{
		//d=?¨?????????????e=????????¢????????°
		int e = 600 / d;
		int x = 0;
		for (int i = 0; i < e; i++) {
			x += d*i*d*d*i;
		}
		cout << x<<endl;
	}
	return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF 1000000001
#define EPS 1.0e-6

using namespace std;

typedef long long ll;

int main()
{
	int s = 0;

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

	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define EXIST(v,i) (find(all(v), i) != (v).end())
#define ERASE(v,i) (v).erase(remove(all(v), i), (v).end())
#define INDEX(v,i) (find(all(v), i) - (v).begin())
#define rep(i,n) for(int i = 0; i < (int)n; ++i)
#define debug(x) cerr << #x << " = " << (x) << endl;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

const int INF = 100000000;
const double PI = 3.14159265358979323846;
const double EPS = 1e-10;


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

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

C++: #include<bits/stdc++.h>
using namespace std;
signed main(void){
	ios::sync_with_stdio(false);
	int d,ans=0;
	cin>>d;
	for(int i=0;i<600;i+=d)
		ans+=i*i*d;
	cout<<ans<<endl;
}

C++: #include <iostream>

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

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

using namespace std;

int f(int);
int integral(int);

int main(void) {
	int a, b;

	while(cin >> a >> b) {
		cout << integral(a) << endl; 
		cout << integral(b) << endl;
	}
	return 0;
}
int integral(int d){
	int n = 600 / d;
	int sum = 0;

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

	return sum;
}

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

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

using namespace std;

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

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

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

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

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

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

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

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

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

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
 
using namespace std;
 
int main(){
 
    int d,sum;
    while(scanf("%d",&d)!=EOF){
        sum = 0;
        for(int i=d;i<=600;i+=d){
            sum += d*(i-d)*(i-d);
        }
        printf("%d\n",sum);
    }
 
    return 0;
}

C++: #include<bits//stdc++.h>
using namespace std;
int main(){
	int d;
	while(cin>>d){
		int e=600/d;
		long long sum=0;
		for(int i=1;i<e;i++){
			sum+=((d*i)*(d*i)*d);
		}
		cout<<sum<<endl;
	}
}

C++: #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <stack>
#include <cstring>

using namespace std;

int main(){
	int menseki;
	int d;
	while(cin >> d){
	menseki = 0;
	
	for(int i = 1; i * d < 600; i++){
		menseki += (i * d) * (i * d) * d;
	}

	cout << menseki << endl;
	}
	return 0;
}

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

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

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

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

int area(int d) {
   int x,y,sum,i;
   x=600;
   y=f(d);
   sum=0;
   i=1;
   
   while(d*i<=600-d)
   {
       sum+=y*d;
       i++;
       y=f(d*i);
   }
    return sum;
　　
}

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

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

using namespace std;

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


int main() {
  int d;
  while(scanf("%d", &d) != EOF) {
    long long sum = 0;
    for(int i = 1; i*d <= 600 - d; i++) {
      sum = sum + f(i*d) * d;
    }
    cout << sum << endl;
  }

  return 0;
}

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

using namespace std;

int main()
{
    int lub;
    int d;
    long long area;

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

    return 0;
}