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 <vector>
#include <cmath>

using namespace std;

int f(int x){
	return pow(x,2);
}

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

	}
}

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

using namespace std;

int main(){
  const int x = 600;
  int d,area=0,height=0,width;
  vector<int> data;
  while(cin >> width){
    data.push_back(width);
  }

  for(int j=0; j<data.size(); j++){
    width = data[j];
    area=0;
    d = x/width;

    for(int i=0; i<d; i++){
      height = (width*i)*(width*i);
      area+=height*width;
    }
    cout << area << endl;
  }
  return 0;
}

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

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

int integral(int d, int d0){
    if(d >= 600){
        return 0;
    }
    
    return(f(d)*d0 + integral(d+d0, d0));
}

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

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

#define loop(i,a,b) for(int i = a ; i< b ; i ++)

int main(void){
  int d;
  while(cin>>d){
    long long int sum =0;
    loop(i,1,600/d)
      sum+=i*i*d*d*d;
    cout<<sum<<endl;
  }
  return 0;
}

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

using namespace std;

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

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

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

int main(){
	int d,s;

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

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

using namespace std;

int d;

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


int main()
{
    cout << "Lenght of d : ";
    cin >> d;
    int SquareAmount = 600/d;
    int TotalArea = 0;
    int Height;

    for(int y = d; y < 600; y = y + d)
    {
        Height = SquareTheX(y);
        TotalArea = TotalArea + (d*Height);
    }

    cout << TotalArea;
    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<memory>
#include<array>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>

using namespace std;

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

int main()
{
  int d;
  while( cin >> d )
    {
      int area = 0;

      for ( int i = 1; i < 600/d; ++i )
        area += d * f( i * d );

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

C++: 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>

using namespace std;


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

int main(){
	cout.setf(ios::fixed);
	cout.precision(5);
	solve();

	return 0;
}

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

using namespace std;

int main(void){
	int s = 0, d;
	cin >> d;
	
	for(int i = d; i < 600; i += d) s = s + i * i;

	cout << s << endl;

	return 0;
}

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

using namespace std;

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

int main(void)
{
	int n,sum;
	while (scanf("%d",&n)!=EOF) {
		sum=0;
		for(int i=1;i<(600/n);i++){
			sum+=pow(n*i)*n;
		}
		
		cout<<sum<<endl;
	}
	
	return (0);
}

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

C++: #include<iostream>
using namespace std;
int main(){
	int d, s = 0, a;
	for (int i = 0; i < 20; i++){
		s = 0;
		cin >> d;
		a = 600 / d;
		for (int j = 1; j < a; j++){
			s = s + d*d*d*j*j;
		}
		cout << s << endl;
	}
	return 0;
}

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

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

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

C++: #include <stdio.h>
#include <math.h>

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

int main() {

        int d;
        double sum;
        int i;

        scanf("%d",&d);

        for(i=0;i<600/d;i++) {
            double x = i*d;
            
            sum = f(x)*d+sum;
            
        }

        printf("%f\n",sum);

        return 0;
}

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

using namespace std;

int main(void){
    int i,j,d;
    double ans=0;
    while(cin >> d){
        i=0;
        ans=0;
        while(i<600){
            ans+=i*i*d;
            i+=d;
        }
        printf("%.0lf\n",ans);
    }
    return 0;
}

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

int main(){

  int d;
  int sum;

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


  return 0;
}

C++: #include <iostream>

using namespace std;

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

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

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

#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for(int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
    int to, cost;
};

const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);

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

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

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

    ll d;
    
    while(cin >> d)
    {
        ll sum = 0;
    
        FOR(i, 1, 600 / d)
        {
            sum += d * func(d * i);
        }

        cout << sum << endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;
 
int main(){

	int d;
	while(cin >> d){
		ll ans = 0;
		for(int i = 0; i < 600; i+= d){
			ans += (i * i * d);
		}
		cout << ans << 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 n;
	while (cin >> n) {
		int s = 0;
		for (int i = 1; i < 600 / n; i++) {
			s += (i*n)*(i*n)*n;
		}
		cout << s << endl;
	}

	return 0;
}

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

int main(void){
    int d;

    while(cin >> d){
        int COUNT = 0;

        for (int i = d; 600 > i; i = i + d){
        	int j = i * i * d;
        	COUNT = COUNT + j;
         }

         cout << COUNT << endl;
    }

    return 0;
}