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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#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>

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 long long LL;
typedef unsigned long long ULL;

//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(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
  int x, y, n = 600;

  while(cin >> x) {
    int result = 0;
    for(int i = x; i < n; i += x) {
      y = i*i;
      result = result + x*y;
    }
    cout << result << endl;
  }
}

C++: #include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

int main(void) {
	int total = 0;
	int n;
	int t;
	
	while (cin >> n) {
		total = 0;
		t = 600 - n;
		while (t>0) {
			total += t*t*n;
			t -= n;
		}
		cout << total << endl;
	}
	
	return 0;
}

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

int main(){
	int i, d, x,  s;
	while(cin >> d){
		x = s = 0;
		while(x < X){
			s += (x*x) * d;
			x += d;
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include <iostream>

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

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

int d ;				// 入力を受ける
int total = 0 ;		// 合計

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

		cout << total << endl ;
		total = 0 ;
	}

	return 0 ;
}

C++: /*
 * Problem     : AOJ0014
 * Title       : Integral
 * Author      : mizo0203
 * Copyright   : Your copyright free
 * Description : スタック
 */

#include <stdio.h>
#include <stack>
using namespace std;

int d, sum;

bool input() {

  if (scanf("%d", &d) == EOF)
    return false;

  return true;
}

int main() {
  int i;

  while (input()) {
    sum = 0;
    for (i = d; i < 600; i+=d) {
      sum += i * i * d;
    }
    printf("%d\n", sum);
  }

  return 0;
}

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

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

int main(void)
{
  const int max_x = 600;
  int d = 0;

  while (std::cin >> d) {
    int loop = max_x / d;

    int sum = 0;
    for (int i = 0; i < loop; i++) {
      sum += d * func(d * i);
    }

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

  return 0;
}

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

using namespace std;

int main()
{
	int d;

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

		for ( int i = 0; i * d < 600; i++ )
		{
			res += d * pow( i * d, 2 );
		}

		cout << res << endl;
	}

	return 0;
}

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

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

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

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

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

double rectangle_method(double a, double b, int n) {
  double acc = 0, d = (b - a) / n;
  for (int i = 0; i < n; i++) {
    acc += func(a + i * d) * d;
  }
  return acc;
}

int main(){
    int d;
    while(scanf("%d",&d) != EOF){
        cout << (int)rectangle_method(0, 600, 600/d) << endl;
    }

    return 0;
}

C++: #include <iostream>
using namespace std;
int main() {
  for(int i = 0; i < 20;i++) {
  int d;
  cin >> d;

  int n = 1;
  int sum = 0;
  while(n * d < 600) {
    sum += (n*d) * (n*d) * d;
    n++;
  }
  cout << sum << endl;
  }
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>

#define EPS (1e-10)
using namespace std;
#define PI (3.1415926535)

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

int main(){
	int d;
	int s;

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

	return 0;
}