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

C++: #include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

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

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

int main(void){
  int d;
  int sum;
  int x_now;
  cin >> d;
  while(!cin.eof()){
    sum = 0;
    x_now = 0;
    for(int i=600;i!=0;){
      sum += x_now*x_now*d;
      i -= d;
      x_now += d;
    }
    cout << sum << endl;
    cin >> d;
  }
  return 0;
}

C++: #include<stdio.h>

int d,s;

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


	return 0;
}

C++: #include <iostream>

void calc(int vertical, int horizontal, int& area)
{
    if (0 >= vertical)
        return;

    area += (vertical * horizontal);

    return calc(vertical - horizontal, horizontal, area);
}
int main()
{
    int n = 0;

    while (std::cin >> n) {
        int area = 0;
        calc(600, n, area);
        std::cout << area << std::endl;
    }
}

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

int main(){
    // y = x^2
    int d, i, s;
    s = 0;
    for(cin >> d){
        for (i = 0; i < (600/d); ++i){
            s = s + (i * d) * (i * d) * d;
        }
        cout << s << endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <complex>
#include <cmath>
#include <utility>
#include <algorithm>
using namespace std;

int main()
{
    int d;
    int S;
    while(cin >> d && d)
    {
        S=0.0;
        int a = 600/d;
        for(int i=1;i<a;i++)
        {
            S += d*i*d*i*d;
        }
        cout << S << endl;
    }
    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){
      int h = f(i);
      sum += h * d;
    }

    cout << sum << endl;
  }
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
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();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

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

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

	return 0;
}

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

int main(){
	int d;
	while(cin >> d){
		vector<int> sec;
		for(int i = d; i < 600; i += d){
			int y, z;
			y = i * i;
			z = y * d;
			sec.push_back(z);
		}
		int sum = accumulate(sec.begin(), sec.end(), 0);
		cout << sum << endl;
	}
	return 0;
}

C++: #include <stdio.h>
int main(void){
   
int d,i,s,x,y;

   while(scanf("%d", &d)!= EOF) {
       int sum=0;
       
       for(i=1;i<600/d;i++){
           
           x=i*d;
           y=x*x;
           s=d*y;
           sum+=s;
           
       }
       printf("%d\n",sum);
       if(d == 0) {
           break;
           
       }
       
   }
   return 0;
    
}

C++: // Integral

#include <iostream>
using namespace std;

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

C++: #include<cstdio>
#include<iostream>
int main(void){
    int d,sum;
    while(scanf("%d",&d)!=EOF){
    sum=0;
    for(int i=d;i<600;i+=d){
        sum+=i*i*d;
    }
    printf("%d\n",sum);
    }
    return 0;
}

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

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

 	return 0;
}

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

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

	return 0;
}

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

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

C++: 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
using namespace std;

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

C++: #include<stdio.h>
int main()
{
	int m=0,d;
	while(!(scanf("%d",&d)==EOF)){
		m=0;
		for(int i=0;i<(600-d);i++){
			m+=((i+1)*(i+1));
		}
		printf("%d\n",m);
	}
	return 0;
}

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

using namespace std;

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