Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	area := 0
	for sc.Scan() {
		n, _ := strconv.Atoi(sc.Text())
		area = 0

		for i := 1; i < 600/n; i++ {
			area += n * (n * i) * (n * i)
		}

		fmt.Println(area)

	}
}

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

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

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


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

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

C++: #include <iostream>
//using namespace System;

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

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

int GetLowerApproximatedArea(int Delta)
{
	int LowerApproximatedArea = 0;
	for(int i = 0; Delta * i < 600; i++){
		LowerApproximatedArea += Delta * Delta * i * Delta * i;
	}
	return LowerApproximatedArea;
}

int main()
{
	while(true){
		int Delta;
		cin >> Delta;
		if(cin.eof() == true) break;
		cout << GetLowerApproximatedArea(Delta) << endl;
	}
	return 0;
}

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

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

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

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

	return 0;
}

C++: #include <stdio.h>

long 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(i*d);
        }
	    printf("%ld\n", s);
    }
    return 0;
}

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

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

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

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

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

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

C++: #include<cstdio>
int main(){
    int d;
    while(scanf("%d",&d)!=-1){
        int ans=0;
        int upto=600-d;
        for(int i=d;i<=upto;i+=d){
            ans+=(i*i)*d;
        }
        printf("%d\n",ans);
    }
}

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

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

int main(void)
{
  int a=0, i, d;

  scanf("%d", &d);

  for(i=1; i < 600/d; i++)
  {
    a = d * f(d*i) + a;
  }

  printf("%d\n", a);

  return 0;
}

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

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

C++: #include<iostream>

using namespace std;

int main() {

	int d;

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


	return 0;
}

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

int main(void){
  int n, res;
  double buf;
  while(cin >> n){
    res = 0;
    for(int i=0;i<=600-n;i+=n){
      res += pow(i,2) * n;
    }
    cout << res;
  }
  return 0;
}

C++: #include <vector>
#include <iostream>
#include <valarray>
#include <string>
#include <algorithm>
#include <set>
typedef unsigned long long ull;
typedef long long ll;
#define fst first
#define snd second
#define rep(i,n) for(ull i = 0;i<(n);i++)
#define rep1(i,n) for(ull i = 1;i<=(n);i++)
#define revrep(i,n) for(ull i = (n-1);i>=0;i--)
#define all(n) (n).begin(),(n).end()
#define show(x) cout << "debug " << #x << ":" << x << endl;
#define showvec(x) cout << endl << "debug " << #x << ";" << endl; \
    for(ull __i = 0;__i < x.size();__i++){ \
        for(ull __j = 0;__j<x[0].size();__j++){ \
            cout << x[__i][__j] << " "; \
        } \
        cout << endl; \
    } \
    cout << endl;
using namespace std;

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

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

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

using namespace std;

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

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

C++: #include<bits/stdc++.h>
using namespace std;
/* 変数名を被らせない
   デバッグコードを取り除く 
　　提出する問題を間違えない */
#define ANS(x) cout<<x<<endl
#define debug(x) cout<<#x<<": "<<x
int main(){
  int d,s;
  while(1){
    s = 0;
    cin >> d;
    if(cin.eof())break;
    for(int i=1;i<=600/d-1;i++){
      s += (d*i)*(d*i)*d;
    }
    ANS(s);
  }
}

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 = 1;
	}
	return 0;
}