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<iostream>

using namespace std;

int main(){

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

C++: #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;

#define MAX 256
#define S(x) (x*x)

int f(int z){
	if (z < 10)return 1;
	return 1 + f(z / 10);
}

int main(void){
	
	int ans[MAX];
	for (int i = 0; i < MAX; i++){
		ans[i] = 0;
	}

	int d;
	int i = 0;

	while (scanf("%d", &d) != EOF){
		for (int j = d; j <= 600 - d; j += d){
			ans[i] += S(d)*d;
		}
		i++;
	}

	for (int j = 0; j < i; j++){
		printf("%d\n", ans[j]);
	}

	return 0;
}

C++: #include <cstdio>

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

int main ()
{
  int i, dist, tmp;
  int area = 0;

  while (scanf("%d", &dist) != EOF) {
    for (i = 0; i < 600/dist; i++) {
      tmp = dist * (i + 1);
      area += dist * func(tmp);
    }
    printf("%d\n", area);
    area = 0;
  }

  return 0;
}

C++: /*
find integral(0, 600) x^2
*/

#include<iostream>
#include<fstream>
using namespace std;

int f(int x);
const int btm = 0, top = 600;

int main() {
	int d;

	while(cin >> d && d != EOF) {
		int itg = 0;
		for(int i = btm + d; i < top; i += d) { itg += f(i) * d; }

		cout << itg << endl;
	}
}

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

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

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

int main(){

  int d;

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

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

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	ll d;
	while(cin>>d){
		int n=600/d;
		ll sum=0;
		REP(i,n-1){
			sum += (i+1)*(i+1)*d*d*d;
		}
		out(sum);
	}

	return 0;
}

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

double pi = acos(-1);

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

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


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

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

C++: #include <iostream>

using namespace std;

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

    return 0;
}

C++: #include <iostream>

using namespace std;

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

int main() {
    int d;

    while (cin >> d) {
        int s = 0;
        for (int i = 0; i < 600 / d; i++) {
            int x = i * d;
            s += f(x) * d;
        }

        cout << s << 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<<endl;
}
}

C++: #include <iostream>

int main(){
    int d, menseki;
    while(std::cin >> d){
        menseki　=　0;
        for(int x = 0; x < 600; x+=d){
            menseki += d * x * x;
        }
        std::cout << menseki << std::endl;
    }
}

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

#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long long ll;

const int N = 600;

int main()
{
	ll D;
	while(~scanf("%lld",&D)){
		ll ans = 0;
		for(int i = 0;i < N;i += D){
			ans += i * i * D;
		}
		printf("%lld\n",ans);
	}

	return 0;
}

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

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

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

using namespace std;

long long solve(int a, int b){

    long long ret = 1;
    while(b--) ret *= a;
    return ret;

}

int main(){

    int d;

    while(cin >> d){

        long long ans = 0;

        for(int i = 1; i < 600 / d; ++i){
            ans += solve(d * i, 2) * d;
        }

        cout << ans << endl;

    }

}

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

int main()
{
    int d;
    while (std::cin >> d) {
        double s = 0.0;
        for (int i = 1; i < 600 / d; ++i) {
            s += d * d * d * i * i;
        }
        std::cout << (int)s << std::endl;
    }
}

C++: #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

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

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

C++: #include "stdio.h"
#include "math.h"

int main()
{
	int d, x;

	while(scanf("%d", &d) != EOF){
		x = 0;

		for(int i = 0; i < 600; i += d)	x += (d * pow(i, 2.0));

		printf("%d\n", x);
	}

	return 0;
}

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

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

int main()
{
int d;
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 area(int d){
    int x, y, sum, i;
    x = 600;
    y = d * d;
    sum = 0;
    i = 1;
    while(d * i <= 600 - d){
        sum += y * d;
        i++;
        y = (d * i) * (d * i);
    }
    return sum;
}

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