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++: #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
using namespace std;

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

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

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<sstream>
#include<stack>
#include<map>
using namespace std;
#define pd pair<double,double>

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

C++: #include<iostream>

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

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

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

#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
	int n; 
	while(1) {
		if(scanf("%d", &n) == EOF) break;
		int total = 0;
		rep2(i,1,(600/n)) {
			total += n * n * i * n * i;
		}
		cout << total << endl;
	}
	return 0;
}

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

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

C++: #include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
     int d;
     while(cin>>d){
        int a=0,b=0;
        for(int i=0;i<600;i+=d){
            b=i*i;
            a+=b;
        }
        cout<<a*d<<endl; 
     }
    return 0;
}

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


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

int main(void)
{
  int a=0, i, d;

  scanf("%d", &d);

  for(i=1; i < 600/d; i++)
  {
    a = d * f(d*i) + a;
  }

  printf("%d", a);

  return 0;
}

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

int main()
{
	int d;

	while(std::cin >> d)
	{
		int vol=0;

		for(int i=1; i*d<600; ++i)
		{
			vol += d*(d*i)*(d*i);
		}

		std::cout << vol << '\n';
	}

}

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

int area(int d) {
　　return (d*d);
}

int main(void){
    int d;
    while(scanf("%d", &d) != EOF) {
       printf("%d\n", area(d));
    }
    return 0;
}

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

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

C++: #include <stdio.h>

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

C++: #include <iostream>
using namespace std;
int main() { 
  int d;  
  while(cin >> d) {
    int sum=0;  
    for(int i=1; i<600/d; i++) {  
      sum+=(d*i)*(d*i)*d;   
    }   
    cout << sum << endl; 
  } 
  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 <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

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

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

int main()
{
//	cut here before submit 
//	freopen ("testcase.Integral", "r", stdin );
	string str = "";

	while (getline (cin, str ) ){ 
		stringstream ss (str );
		int d;
		ss >> d;
		int area = 0;
		for (int x = d; x <= 600 - d; x += d ){
			area += d*f(x);
		} // end for
		cout << area << endl;
	} // end loop
		
	return 0;
}

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

int main() {
  int d;
  int sum;

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

  return 0;
}

C++: #include<iostream>
#include<sstream>
#include<fstream>
#include<cstdio>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;

int main(){
	int n;
	while(scanf("%d",&n)==1){
		long long k = 600/n-1;
		long long ex = (n*pow(n,2)*((k*(k+1)*(2*k+1))/6));
		cout<<ex<<endl;
	}
	return 0;
}

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

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

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

#define MAX 256
#define S(x) (x*x)

int f(int z){
	if (z < 10)return 1;
	return 1 + f(z / 10);
}

int main(void){
	
	int ans[MAX];
	for (int i = 0; i < MAX; i++){
		ans[i] = 0;
	}

	int d;
	int i = 0;

	while (scanf("%d", &d) != EOF){
		for (int j = d; j <= 600 - d; j += d){
			ans[i] += S(j)*d;
		}
		i++;
	}

	for (int j = 0; j < i; j++){
		printf("%d\n", ans[j]);
	}

	return 0;
}

C++: /*
C++ ???????????????????????????????????¬??????
??????AOJ-ITP1??????????????????
*/
#define _USE_MATH_DEFINES

#include <iostream> // ?¨??????\??????
#include <fstream>  // ??????????????\??????
#include <string>   // ???????????¢???
#include <vector>   // ???????????????
#include <cmath>    // ??°??????
#include <iomanip>  // stream???????????¢???
#include <algorithm>// max??¢??°??????

using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;        // ????´???°????????????????????????
using std::fixed;         // ???????????????????¨???????????????????????????????
using std::setprecision;  // ?????°????°???°?????\???????????°????????????????????¨????????\???

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

C++: #define scanf_s scanf
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 150
#define CONSTNUM 600
int main(void)
{
	int d, sum = 0;
	while(scanf_s("%d", &d) != EOF){
		for (int i = 1; i < CONSTNUM / d; ++i) {
			sum += ((d*i)*(d*i) * d);
		}
		printf("%d\n", sum);
		sum = 0;
	}
}