Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	for sc.Scan() {
		d, _ := strconv.Atoi(sc.Text())
		var area int
		for i := 1; i*d < 600; i++ {
			area += d * (d * i) * (d * i)
		}
		fmt.Println(area)
	}
}

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

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

C++: #include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
#define sort(v,n) sort(v,v+n)
#define vsort(v) sort(v.begin(),v.end())
#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//



int main() {
	int n;
	while (cin >> n) {
		ll sum = 0;
		int now = n;
		while (now < 600) {
			sum += now*now*n;
			now += n;
		}
		cout << sum << endl;
	}
	return 0;
}

C++: #include<stdio.h>

int sq(int n){
  return n*n;
}

int sum(int d,int n){
  if(n>=600){
    return 0;
  }
  else{
    return d*sq(n)+sum(d,n+d);
  }
}

void doit(){
  int n;
  if(scanf("%d",&n)!=EOF){
    printf("%d\n",sum(n,0));
    doit();
  }
}

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

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

int main() {
	ios_base::sync_with_stdio( false );

	int d;
	while( cin >> d ) {
		int area = 0;

		for( int x = d; x < 600; x += d ) {
			area += x*x * d;
		}

		cout << area << '\n';
	}
}

C++: #include <stdio.h>

#define BUF_SIZE 256

int main(void) {
	char buf[BUF_SIZE];
	int d, sum=0;
	int i;
	
	while (fgets(buf, sizeof(buf), stdin) != NULL) {
		sscanf(buf, "%d", &d);
		
		for (i=1; i*d<=600-d; i++) {
			sum+= i*d*i*d*d;
		}
		
		printf("%d\n", sum);
		sum=0;
	}
	
	return 0;
}

C++: #include <iostream>

using namespace std;

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

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

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

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

}

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

using namespace std;

double y(double x){
	double y;
	y=x*x;
	return y;
}

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

C++: #include <stdio.h>

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

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

C++: /*AOJ 0014*/

#include<iostream>
using namespace std;

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

int main(){

	int sum = 0;
	int d;

	while(cin>>d){
		sum = 0;

		for(int i=1;d*i<600;i++){
			sum += f(i*d)*d;

		}

		cout<<sum<<endl;

	}

	return 0;
}

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

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

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

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

C++: #include <iostream>

using namespace std;

int func(int d){
    int rectangle;
    int n = d;
    int total = 0;
    
    while(n < 600){
        rectangle = n*n*d;
        total += rectangle; 
        n += d;
    }
    
    return total;
}


int main (int argc, char const* argv[]){
    int n;
    
    
    while((cin >> n)){
        cout << func(n) << endl;
        
    }
    
    
    return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 1000000
using namespace std;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int main(){
    int d;
    while(cin >> d){
        int s = 0;
        for(int i=d; i<600; i+=d){
            s += i*i*d;
        }
        cout << s << endl;
    }
    return 0;
}

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

C++: #include<stdio.h>

int main()
{
	int d, i;
	while (scanf("%d", &d) != NULL)
	{
		if (d == 0)break;
		int tmp = d, total = 0;
		for (i = tmp; i < 600; i += d)
		{
			total = total + i*i*d;
		}
		printf("%d\n", total);
	}
	return 0;
}

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

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

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

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

using namespace std;

int main()
{
	int d;
	double area;
	int x;
	//int y;
	while(cin >> d)
	{
		x = 0;
		//d = 0;
		area = 0;
		while(x <= 600 - d)
		{
			area += pow(x,2.0) * d;
			x += d;
			//cout << x << endl;
		}
		printf("%7.0lf\n",area );
		//cout << area << endl;
	}
	//cout << area << endl;
}

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

int main()
{
	int i,d;
	while (scanf("%d",&d)!=EOF){
		int sum=0;
		for (i=d;i<=600-d;i+=d){
			sum+=i*i*d;
		}
		printf("%d\n",sum);
	}
	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 <iostream>
#include <string>
#include <algorithm>
using namespace std;

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

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

using namespace std;

int main()
{
	int d;
	double area;
	int x;
	//int y;
	while(cin >> d)
	{
		x = 0;
		//d = 0;
		area = 0;
		while(x <= 600 - d)
		{
			area += pow(x,2.0) * d;
			x += d;
			//cout << x << endl;
		}
		printf("%ld\n",(long int)area );
		//cout << area << endl;
	}
	//cout << area << endl;
}

C++: #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

int d;
void solve() {
    int sum = 0;
    int a = 600 / d;
    rep(i,a) {
        sum += d*i*d*i*d;
    }
    cout<<sum<<endl;
}

int main() {
    while(cin>>d) {
        solve();
    }
    return 0;
}