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++: f :: Int -> Int
f x = x * x

solve :: Int -> Int
solve d = (d*) $ sum $ map f [0 , d .. 600 - d]

main :: IO ()
main  = getContents
    >>= return . map read . lines
    >>= return . map solve
    >>= mapM_ print

C++: #include <iostream>

using namespace std;

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

C++: #include<iostream>
using namespace std;
int n;
int a[1000000];
int sum[1000000];
int main(int argc, char const *argv[])
{

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

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
  int d,s;
  int S = 0;
  int n = 20;
  int y,x;
  while(n > 0){
    cin >> d;
    int y = x * d;
    for(y < 600-d;y++;){
      int x[1000]; 
    int s = y * d;
    int n = n - 1;
    int S = S + s;
  }
    cout << S << endl;
  }
  return 0;
}

C++: #include <stdio.h>
#define NN 600
int f(int x){ return x*x; }
int main(){
	int d,h,s=0;
	while(scanf("%d",&d)!=EOF){
		for(h=d;h<NN;h+=d){
			s += d*f(h);
		}
		printf("%d\n",s);
	}
	return 0;
}

C++: #include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<utility>
#include<string>

using namespace std;

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

C++: #include <stdio.h>

/* http://rose.u-aizu.ac.jp/onlinejudge/ProblemSet/description.jsp?id=0014&lang=jp */


int sqr(int x)	/* x^2 */
{
	x = x * x ;

	return x;
}

int main(void)
{
	int d = 0; /*ßÌ lª¬³¢ÙÇç(0~600) x^2 dx = 72000000 ÉßÃ­*/
	int i = 0; /* for¶Ågp */
	int s = 0;/* ßIÊÏ ÅãÉÔ· */
	
	while(1){
	printf("d?:");	scanf("%d",&d);
	
	if ( 600 % d )
	continue;	else break;		/* dª600ÌñÅÈ¯êÎà¤êñüÍ³¹é */
	
	}
	
	
	for( i = d ; i < 600 ; i += d )
	{
		s += sqr(i) * d ;
	}
	
	
	printf("%d",s);
	
	return 0;
	
}

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

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
	int d, x, y, Y[600];
	int i, sum = 0;

	

	for(i = 0;i < 600;i++){
		Y[i] = 0;
	}
	while(cin >> d){
		for(i = 1;d*i < 600;i++){
			x = d * i;
			y = x * x;
			Y[i] = y * d;
		}
		
		for(i = 1;i < 600;i++){
			sum += Y[i];
		}
		cout << sum << endl;
		sum = 0;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
signed main(){
	int a;
	while( scanf("%d", &a) != EOF ){
		int ans = 0;
		for(int i=a;i<600;i+=a){
			ans += i*i*a;
		}
		cout << ans << endl;
	}
	return 0;
}

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;
		for(int i=0 ; i<num ; i++){
			s+=od*f(d);
			d+=od;
		}
		cout << s << endl;
		s=0;
	}
	return 0;
}

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

#define f(x) ((x) * (x))

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

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
    for(int d; cin >> d; ){
        int ans = 0;
        for(int dd = d; dd <= 600 - d; dd += d)
          ans += d * dd * dd;
        cout << ans << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int ll;

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

C++: #include<iostream>
using namespace std;
int a;
int main() {
	while (cin >> a) {
		cout << (900 - a)*(900 - a) * 100 - 9000000 << endl;
	}
}

C++: #include <iostream>

using namespace std;

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

int main() {
    int d;
    while( cin >> d)
    {
        int l = d;
        int s = 0;
        while(l <= 600 - d)
        {
            s += fx(l) * d;
            l += d;
        }
        cout << s <<endl;
    }
    return 0;
}

C++: #include <stdio.h>

int main(void){
    int d;
    int s;
    int d3;
	
    while (scanf("%d", &d)){
        s=0;
        d3 = d*d*d;
        for (int i=0; i<600/d; i++){
            s += d3*i*i;
        }
	printf("%ld\n", s);
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int d, k, s, x;
	while (cin >> d){
		s = x = 0;
		k = 600 / d;
		for (int i = 0; i < k; ++i, x += d)
			s += x * x * d;
		cout << s << "\n";
	}
	return 0;
}

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

int main(){
	int d,i,ans,d_di;
	while(cin>>d){
		ans = 0;
		for(i = d;i < 600;i += d){
			ans += i*i*d;
		}
		cout<<ans<<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 << endl;
  }
  return 0;
}

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

int main(){

  int d;

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

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

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

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

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

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

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