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>

using namespace std;

int h(int d) {
	return d*d;
}

int s(int d) {
	int n = 600/d; bool plus = (600%d==0 ? 0 : 1);
	int ret = 0;
	for (int i=1; i<n; i++) ret += d*h(i*d);
	if (plus) ret += d*h(600-d);
	return ret;
}

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

C++: #include <iostream>
#include <string>
#include <cctype>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <map> // pair
#include <set>
#define MAXSIZE 200000
#define PI 3.141592653589
using namespace std;

template<typename T>
T add(T a,T b){
  return a+b;
}

namespace A
{
  int f(void){
    return 1;
  }
}

int main(){
  int d;

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

    std::cout << sum << '\n';
  }

}

C++: while gets
	a=c=$_.to_i
	b=0
	while c<600
		b+=c*c*a
		c+=a
	end
	puts b	
end

C++: main(d){for(;~scanf("%d",&d);printf("%d00\n",d*=d-6e2))d-=600;}

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

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

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

 return 0;
}

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

C++: #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
int main(){
	int x;
	while(cin>>x){
		int ans=0;
		for(int i=x;i<=600-x;i+=x){
			ans+=i*i*x;
		}
		cout<<ans<<endl;
	}
}

C++: #include <iostream>

using namespace std;

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

int main()
{
	solve();
	return(0);
}

C++: #include <stdio.h>

int main(void){
    int d;
    long s;
	
    while (scanf("%d", &d)){
        s=0;
        for (int i=0; i<600/d; i++){
            s += d*(i*d)*(i*d);
        }
	    printf("%ld\n", s);
    }
    return 0;
}

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

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

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

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

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

C++: #include <iostream>

using namespace std;

int main(void) {
    int d, s;
    while (1) {
        cin >> d;
        if (cin.eof()) break;
        s = 0;
        for (int x = d; x < 600; x += d) s += d * x * x;
        cout << s;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int Integral(int h, int d)
{
	if(h >= 600)	return 0;
	else		return (h*h*d) + Integral(h+d, d);

}
int main()
{
	int d;

	while (cin >> d)
	{
		cout << Integral(d, d) << endl;
	}

	return 0;
}

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

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

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

C++: #include<iostream>

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

int main(){
	int d;
	
	while(std::cin >> d){
		double n = 600/d;
		int S = 0;
		
		for(int i=1; i<n ; ++i){
			S += function(i*d) * d;
		}
		
		std::cout << S << std::endl;
	}
	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<600 ; i+=d ){
            s+=i*i*d;
        }
    　　cout << s << endl;
    }
	return 0;
}

C++: #include <iostream>

using namespace std;

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

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

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

C++: #include <iostream>

using namespace std;

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

C++: #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;


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

C++: //0014 Integral

//vñFy=x^2Ay=0Ax=600ÉÍÜê½ÊÏðAÏªÁÛ­ßé
//ßIÈÊÏðoÍµÈ³¢
//üÍÍ¡sÅ^¦çêA1sÉÍ600Ìñd¾¯ªÜÜêé@üÍÌI¹ÍEOFÅ\³êé
//»ê¼êÌüÍdÉÎµAßIÈÊÏð1s²ÆÉoÍ¹æ

//¿ÈÝÉdð¬³­·êÎ·éÙÇA72000000ÉßÃ­

#include<iostream>
using namespace std;

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

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

int main(){
cout << "azunyan" << endl;
}

C++: //#include<cstdio>
//#include<cmath>
 
#include<iostream>
using namespace std;
 
int main(){
long d, x, S;

	while( scanf("%d" , &d)!= EOF){
		for(S=0, x=0; x<600; x+=d)	S+=(x*x);
 		printf("%d\n",S*d);
	}

    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


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

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

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

using namespace std;

int calc(int n){
	int sum = 0;
	
	for(int x = 0; x < 600; x += n){
		sum += x*x*n;
	}

	return sum;
}

int main(){
	vector<int> ans;
	int n;

	while(cin >> n){
		if(cin.eof()){
			break;
		}

		ans.push_back(calc(n));
	}

	for(int& i: ans){
		cout << i << endl;
	}
}