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>

using namespace std;

int Integral(int h, int d)
{
	if(h >= 600)	return 0;
	else		return (h*h*d) + Integral(h+d, d);

}
int main()
{
	int d;

	while (cin >> d)
	{
		cout << Integral(d, d) << endl;
	}

	return 0;
}

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

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

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

C++: #include<iostream>

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

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

C++: #include <iostream>
#include <string>
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,i,S;
	while(cin >> d){
		for(i=1,S=0;i<600/d;i++)
			S+=d*d*d*i*i;
		cout << S << endl;
	}
}

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

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

C++: #include <iostream>

using namespace std;

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

C++: #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
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*i)*(d*i)*d;
        }
    printf("%d\n",ans);
    }
    return 0;
}

C++: //0014 Integral

//vñFy=x^2Ay=0Ax=600ÉÍÜê½ÊÏðAÏªÁÛ­ßé
//ßIÈÊÏðoÍµÈ³¢
//üÍÍ¡sÅ^¦çêA1sÉÍ600Ìñd¾¯ªÜÜêé@üÍÌI¹ÍEOFÅ\³êé
//»ê¼êÌüÍdÉÎµAßIÈÊÏð1s²ÆÉoÍ¹æ

//¿ÈÝÉdð¬³­·êÎ·éÙÇA72000000ÉßÃ­

#include<iostream>
using namespace std;

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

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

int main(){
cout << "azunyan" << endl;
}

C++: //#include<cstdio>
//#include<cmath>
 
#include<iostream>
using namespace std;
 
int main(){
long d, x, S;

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

    return 0;
}

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

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


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

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

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

using namespace std;

int calc(int n){
	int sum = 0;
	
	for(int x = 0; x < 600; x += n){
		sum += x*x*n;
	}

	return sum;
}

int main(){
	vector<int> ans;
	int n;

	while(cin >> n){
		if(cin.eof()){
			break;
		}

		ans.push_back(calc(n));
	}

	for(int& i: ans){
		cout << i << endl;
	}
}

C++: #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>

using namespace std;






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

}

C++: #include <iostream>
int main()
{
  int d;
  while (std::cin >> d) {
    int n = 0, s = 0;
    while (n < 600) {
      s += n * n * d;
      n += d;
    }
    std::cout << s << std::endl;
  }
  return 0;
}

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

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

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

int main(){
	int d;
	long sum;
	int n;

	while(cin >> d){
		sum = 0;
		n = 600 / d;

		for(int i=1;i<n;i++){
			sum += d * d*d*i*i;
		}
		cout << sum << endl;
	}
	return 0;
}

C++: #include <stdio.h>

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

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


int main()
{
	int d,i;
	long sum;
	while( cin >> d ) {
		sum = 0;
		for( i = 0; i < 600; i += d ) {		
			sum += d * i * i;
		}
		printf("%d\n",sum);

	}
		

	return 0;
}

C++: #include<iostream>

using namespace std;

#define MAX_X 600

int main(void)
{
	int d;
	int s = 0;

	while(1){
		while(1){
			cin >> d;
			if( MAX_X % d == 0 ) break;
		}
		if( cin.eof() ) break;

		for( int i = 0 ; i < MAX_X / d ; i++ )
		{
			int height = ( i * d ) * ( i * d );
			int width = d;
			s += height * width;
		}
		cout << s << endl;
		s = 0;
	}

	return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	long long d;
	while(cin >> d){
		long long ans=0;
		for(int i=0;i<600;i+=d){
			if(i+d<=600){
				ans+=i*i*d;
			}else{
				ans+=i*i*(600-d);
			}
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
const int mod = 1e9 + 7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}

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