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++: <?php  
///$r = trim(fgets(STDIN))
while(fscanf(STDIN, "%d", $r)){  
	$sum = 0;
	for($i = 0; $i < 600; $i+=$r){
		$sum+=($i*$i)*$r;
	}
	echo $sum;
}
?>

C++: /*
　　　　 ∧＿∧　にっぽんちゃちゃちゃ
　／＼（　・∀・）／ヽ
（ ●　と　　　つ　● ）　にっぽんちゃちゃちゃ
　＼/⊂、 ノ　　＼ノ
　　　　　し'
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define MOD 1000000007
#define INF 9223372036854775807

signed main()
{
int x=0,y=0,z=0,w=0,n=0,d=0;
while(std::cin >> d){
  for(int i=1;i*d<=600-d;i++){
    y+=(i*d)*(i*d)*d;
  }
  std::cout << y<< '\n';
  y=0;
}
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

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

C++: #include<iostream>

using namespace std;

int main(){
	int d;
	int i, I = 0;

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

	return 0;
}

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

int main()
{
 int d;
 while(cin>>d)
 {
   for(int i=1;i*d<d;++i)
   {
     f=0;
     f=d*(d*i)*(d*i);
    }
    cout<<f<<endl;
   }
   return 0;
   cin.get();
  }

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

using namespace std;

int area(int d) {
	return d*pow(d,2);
}

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

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

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

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

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>

#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 SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;

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

int Integral(int d){
	int w, h, s;

	w = d; 
	s = 0;
	
	while (w != 600){
		h = w*w;
		s += d*h;
		w += d;
	}

	return s;
}

int main(){
	ios::sync_with_stdio(false);
	int n;

	while (cin >> n){
		printf("%d\n", Integral(n));
	}
}

C++: // 2011/06/17 Tazoe

#include <iostream>
using namespace std;

int main()
{
	while(true){
		int d;
		cin >> d;
		if(cin.eof())
			break;

		int sum = 0;
		for(int i=1; i<600/d; i++)
			sum += i*d*i*d*d;

		cout << sum << endl;
	}

	return 0;
}

C++: while (a=c=gets.to_i)>0
b=0
while c<600
b+=c*c*a
c+=a
end
puts b
end

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