Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	n, err := strconv.Atoi(nextString())
	return n, err
}

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

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		d, err := nextInt()
		if err != nil {
			break
		}

		area := 0
		for i := 0; i < 600/d; i++ {
			x := i * d
			area += f(x) * d
		}
		fmt.Println(area)
	}
}

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

C++: #include<bits/stdc++.h>
#include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007

using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pair<double,Pi> Pdi;
typedef pair<ll,int>Pli;
typedef pair<P1,ll> P2;
typedef pair<string,string> Ps;
const ll INF=1000000000000000001;
struct edge{int to,cost;};
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
struct Road{double cost;int a,b;};
struct pos{
	// 1 変数を入れる;
	int x,y,sx,sy,cost;
};

int main() {

	while(1){
		int a;
		cin>>a;
		if(cin.eof())break;
		ll t=0;
		for(int i=1; i<600/a; i++){
			t+=i*i*a*a*a;
		}
		cout<<t<<endl;
	}

	return 0;
}

C++: #include <stdio.h>

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

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

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

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

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

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

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

C++: #include<cstdio>

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

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

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

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

		for (int i = d; i <= 600 - d; i += d) {
			S += d * i * i;
		}
		cout << S << endl;
	}
}

C++: #include<iostream>
#include<cstdio>
#define N 600
double f(double x){
    return x*x;
}


int main(void){
    int d,i;
    double sum;    
    while(scanf("%d",d)){
        sum=0;
        for(int i=d;i<N;i+=d){
            sum+=f(i);
        }
        std::cout<<sum<<std::endl;
    }
    return 0;
}

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

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

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

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

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

C++: #include <iostream>

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

long integral(long x_begin, long x_end, long delta)
{
	long result = 0;
	for (long x = x_begin; x < x_end; x += delta) {
		result += f(x) * delta;
	}
	return result;
}

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

C++: #include <iostream>
using namespace std;
double f(int x);

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

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

C++: #include <iostream>
 
using namespace std;
int main(void){
        int d;
        while(!cin.eof()){
                cin >>d;
                int total=0;
                for(int i=d; i<600; i+=d)
                        total+=d*i*i;
                cout << total << endl;
        }
        return 0;
}

C++:  #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 
 using namespace std;
 
 int main()
 {
   int d;
   while(cin>>d)
   {
     int s=0;
     int yield=600/d;
     for(int i=0;i<yield-1;i++) s+=(i+1)*(d)*(i+1)*(d)*d;
     cout<<s<<endl;               
   }
   //while(1);      
   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 <bits/stdc++.h>
using namespace std;

int main() {
	int d;
	while (cin >> d) {
		int64_t s = 0;
		for (int64_t i = d; i <= 600 - d; i += d) {
			s += i * i * d;
		}

		cout << s << endl;
	}
}

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

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

C++: #include <stdio.h>
#define NN 600
int f(int x){ return x*x; }
int main(){
	int d,h;
	double s=0;
	while(scanf("%d",&d)!=EOF){
		for(h=d;h<NN;h+=d){
			s += d*f(h);
		}
		printf("%lf\n",s);
	}
	return 0;
}

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

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

using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()

#define rep(i,n) for(int i = 0; i < (n);++i)
#define repc(i,a,b) for(int i = (a);i <(b);++i)
#define repa(n,array) for(auto n :(array))

typedef long long ll ;
typedef vector<int> vi ;
typedef vector<ll> vl ;

constexpr int IMAX = ((1<<30)-1)*2+1 ;
constexpr int INF = 100000000;
double EPS = 1e-10 ;

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

C++: #include <iostream>

using namespace std;

int main()
{
    int d;
    int LuasPersegiPanjang = 0;
    int TinggiPersegiPanjang[600];
    int TinggiSementara;

    cin >> d;

    int BanyakPersegiPanjang = 600/d;
    TinggiSementara = d;
    for(int x = 0; x < BanyakPersegiPanjang-1; x++)
    {
        TinggiPersegiPanjang[x] = TinggiSementara*TinggiSementara;
        TinggiSementara = TinggiSementara + d;

        LuasPersegiPanjang = LuasPersegiPanjang + (TinggiPersegiPanjang[x] * d);
    }

    cout << LuasPersegiPanjang;


}

C++: #include <iostream>
#define f(a) ((a)*(a))

using namespace std;
int main(){
    int d;
    long long int sum;
    while(cin >> d){
        sum=0;
        for(int i=1;i*d<600;i++){
            sum+=f(i*d)*d;
        }
    cout << sum << endl;
    }
    return 0;
}