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>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define f(x) x*x
using namespace std;
int ans;
int main(){
    int ma,n;
    while(cin>>n){
        for(int i=n;i<600;i+=n){
            ans += (f(i) * n);
        }
        cout<<ans<<endl;
        ans=0;
    }
return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define min(v,w) v>w?w:v;
#define max(v,w) v<w?w:v;
#define INF 0x3f3f3f3f3f3f3f3f
#define MAXN 30

struct p{
	int x,y;
};

int main(){  

	__int64 a,b,c,d,t;
    while(~scanf("%I64d",&d))  { 
		b=0;
		t=d;
		for(;d<600;d+=t){
			b+=t*d*d;			
		}
		if(d<600)
			b+=(600-d)*d*d;
		printf("%I64d\n",b);
	}
	return 0;
}

/*
((F(TF))(TF(F(TF(TF))))(F(TF))(TF))
(TFT)
((TFT)T)

*/

C++: #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;

#define ISEQ(c) (c).begin(), (c).end()
typedef long long ll;

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

C++: #include <stdio.h>
#include <stdlib.h>
//#include <iostream>
//#include <vector>
//using namespace std;

#define MAX_LENGTH 8192
#define MYSCAN scanf_s

int f(int x);

int main(void){
	
	int large, input, count;
	int d[MAX_LENGTH];

	// テ・ツ仰陛ァツ堋?」ツ?ォテァツ「ツコテ、ツソツ敕」ツ?療」ツ?淌ゥツ?催・ツ按療」ツ?ォテ・ツ?・テ・ツ環崚」ツつ津ヲツオツ?」ツ?療ィツセツシテ」ツつ?
	for (count = 0; MYSCAN("%d", &d[count]) != EOF; count++);

	// テ・ツ青?・ツ?・テ・ツ環崚」ツ?ォテ・ツッツセテ」ツ?療」ツ?ヲテヲツ督催、ツスツ?
	for (int i = 0; i < count; i++){
		large = 0;
		for (int j = 0; j < (600 / d[i]) - 1; j++){
			large += f((j + 1) * d[i]) * d[i];
		}
		printf("%d\n", large);
	}

	system("PAUSE");
	return 0;
}

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

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

using namespace std;

int d;
int sum;
int height;


int main(){
	while(cin >> d){
		sum = 0;
		for(int now = 600 - d;now >= d;now -= d){
			height = now * now;
			sum += height * d;
		}

		cout << sum << endl;
	}

}

C++: #include<cstdio>

using namespace std;

#define Fx(x) ((x)*(x))

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

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

int main(){
	int d;
	int n;

	cin >> d;
	
	n = 600 / d;

	int sum = 0;

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

	return 0;

}

C++: #include <iostream>

using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#define rep(x,to) for(x=0;x<to;x++)
#define rep2(x,from,to) for(x=from;x<to;x++)

using namespace std;


int main(void){

int dd,i;	

	while(cin >> dd){
		int ws = 600 /dd;
		int ss =0;
		rep2(i,1,ws){
			ss += dd * i * dd * i * dd; 
		}
		cout << ss << endl;
	}
	return 0;
}

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

int main()
{
	int N;
	while (cin >> N) {
		int count = 0;
		for (int i = 0; i < 600 / N-1; i++) {
			count += N * (N + i * N)*(N+i*N);
		}
		cout << count;
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s

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

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

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

C++: #include <iostream>
 
int main(){
    int d;
     
    while(std::cin >> d){
        int sum = 0;
        for(int i = d; i < 600; i += d){
            sum += i*i*d;
        }
         
        std::cout << sum << std::endl;
    }
     
    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*i)*(d*i);
    }
    S *= d;
    cout << S <<endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
int main(){
	int d;
	while(cin>>d){
		int s=0;
		for(int x=d;x<600;x+=d) s+=x*x*d;
			cout<<s<<endl;
	}
}

C++: #include <bits/stdc++.h>
#define rep(i,l,n) for(i=l;i<n;i++)
using namespace std;

int main(){
	int d,s,i,n;

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

C++: #include <iostream>

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

        std::cout << sum << std::endl;
    }

    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#define fi first
#define se second
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int INF=10000009;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
	int d;
	while(cin>>d){
		int S=0;
		for(int i=1;i*d<=600-d;i++){
			int x=i*d;
			x=x*x;
			x*=d;
			S+=x;
		}
		cout<<S<<endl;
		S=0;
	}
}

C++: #include <cstdio>

int main(int argc, char *argv[]) {
	using namespace std;
	
	int rcv;
	
	while (EOF != fscanf(stdin, "%d", &rcv)) {
		int sum = 0;
		for (int i = rcv; i < 600; i+=rcv) {
			sum += i * i * rcv;
		}
		printf("%d\n", sum);
	}
	return 0;
}

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

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

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

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