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

C++: #include <iostream>

using namespace std;

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

int main() {
    int d, i, x, max, sum = 0;
    while(cin >> d){
        max = (600-d) / d;
        sum = 0;
        for(i = 1, x = d; i <= max; ++i, x = i*d) {
            sum += d * y(x);
        }

        cout << sum << endl;
    }
}

C++: #include <iostream>
#include <string>
#include <algorithm>

using namespace std;

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

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

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

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

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

using namespace std;

int main(void){
	int s = 0, d;
	cin >> d;
	
	for(int i = d; i < 600; i += d) s = s + i * i;

	cout << s;

	return 0;
}

C++: #include <iostream>

using namespace std;

int d;

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

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

    return 0;
}

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

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

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

int main()
{
  int d;
  int i,j;
  int h;

  while(scanf("%d", &d)!=EOF){
    int  sum=0;
    for(i=1;i<600/d;i++)
      sum+=d*d*d*i*i;
    cout<<sum<<endl;
  }
}

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

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

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

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

int main(void)
{
  int a, 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 f(int d) {
	int y;
	y = d * d;
	return y;
}


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

C++: #include<iostream>

using namespace std;

int main(void) {
	int d;
	long long res;
	int i;

	while(!cin.eof()) {
		cin >> d;
		res = 0;
		for(i = d; i < 600; i+=d) {
			res += i*i*d;
		}
		if(!cin.eof()) { cout << res << endl; }
	}

	return 0;
}

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

int main(){
	int d, ans = 0, n;
	while(cin >> d){
		//ans = pow(d, 3);
		n = 600 / d - 1;
		ans *= n*(n+1)*(2*n+1) / 6;
		cout << ans << endl;
	}
	return 0; 
}

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

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

C++: #include<iostream>
#include<vector>
int main()
{
	std::vector<int>result;
	for (int d; std::cin >> d;)
	{
		result.push_back(0);
		for (int i = d; i < 600; i += d)
		{
			result.back() += i * i * d;
		}
	}
	for (auto i : result)
	{
		std::cout << i << std::endl;
	}
	return 0;
}

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