Go: package main

import "fmt"

func main() {
	var d int
	for {
		v, _ := fmt.Scan(&d)
		if v == 0 {
			break
		}
		sum := 0
		for i := 0; i < 600/d; i++ {
			sum += d*d*i*d*i
		}
		fmt.Println(sum)
	}
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;

//conversion
//------------------------------------------
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();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const double INF = 1e12;


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

C++: /* All men have limits. They learn what they are and learn
   not to exceed them, I ignore mine. -Batman           */

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


int main(){

	int i,j;
	long long sum;
	int n;
	while(scanf("%d", &n) != EOF){
		i = 0;
		sum = 0;
		while( i != 600){
			sum += n*i*i;
			i += n;
		}
		printf("%lld\n", sum);
	}

return 0;
}

C++: #include<iostream>
#include<stdio.h>
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 * pow(d*i, 2);
		}
		cout << ans << endl;
	}
}

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;

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

C++: #include <stdio.h>

int f(int x);

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

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

C++: #include <iostream>
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;
	long s;
	while(cin >> d){
		s = 0;
		for(int i = 1; i * d + d <= 600; i++){
			s +=  (d * i) * (d * i) * d;
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include <iostream>

using namespace std;


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

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

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

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

	int d;
	while(cin >> d){
		int ans = 0;
		for(int i = 1; i < 600 / d; i++){
			ans += d * (i * i * d * d);
		}
		cout << ans << '\n';
	}
	return 0;
}
// Write Here

C++: #include <iostream>

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


int main(){
  u_int d;

  while(std::cin >> d)
    std::cout << getArea(d) << std::endl;

  return 0;
}

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

C++: #include <iostream>

using namespace std;

int main(){
	int d;
	int sum = 0;

	while(cin >> d){

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

}

C++: /*#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	CI n;
	return;
}


int main(void) {
	input();
	double money = 100000;
	
	for (int i = 0; i < n; i++) {
		money *= 1.05;
	}
	
	if ((int)money % 1000 >= 500) {
		CO (int)(money - ((int)(money) % 1000) + 1000) E
	}
	else {
		CO (int)(money - ((int)(money) % 1000)) E
	}

	

	return 0;
}

*/

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
long long int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	
	return;
}


int main(void) {
	
	int i = 1;
	int sum = 0;
	
	while (scanf("%d",&n) != EOF) {
		while (true) {
			sum += (n * n * (i - 1) * n * (i - 1));
			if ((n * i) == 600)break;
			i++;
		}

		CO sum E
		sum = 0;
		i = 0;
	}
	return 0;
}

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