Go: package main

import "fmt"

func main() {
	var d int
	for {
		v, _ := fmt.Scan(&d)
		if v == 0 {
			break
		}
		sum := 0
		for i := 0; i < 600/d; i++ {
			sum += d*d*i*d*i
		}
		fmt.Println(sum)
	}
}

C++: #include <algorithm>
#include <iostream>
#include <stdio.h>

using namespace std;

int main(void){
    int i,j,d;
    double ans=0;
    while(cin >> d){
        i=0;
        ans=0;
        while(i<600){
            ans+=i*i*d;
            i+=d;
        }
        printf("%.0lf\n",ans);
    }
    return 0;
}

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

int main(){

  int d;
  int sum;

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


  return 0;
}

C++: #include <iostream>

using namespace std;

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

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

C++: #include <bits/stdc++.h>

#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for(int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
    int to, cost;
};

const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);

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

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

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll d;
    
    while(cin >> d)
    {
        ll sum = 0;
    
        FOR(i, 1, 600 / d)
        {
            sum += d * func(d * i);
        }

        cout << sum << endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;
 
int main(){

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

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF 1000000001
#define EPS 1.0e-6

using namespace std;

typedef long long ll;

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

	return 0;
}

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

int main(void){
    int d;

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

        for (int i = d; 600 > i; i = i + d){
        	int j = i * i * d;
        	COUNT = COUNT + j;
         }

         cout << COUNT << endl;
    }

    return 0;
}

C++: #include <stdio.h>

int f(int x);

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

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

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

C++: #include <iostream>
 
using namespace std;
int main(void){
        int d;
        while(true){
                cin >>d;
                if(cin.eof())
                  break;
                int total=0;
                for(int i=d; i<600; i+=d)
                        total+=d*i*i;
                cout << total << endl;
        }
        return 0;
}

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

int main(void){

    int area = 0;

    int n,x,y;
    while(cin >> n){

        for(int i = 0;i < 600 / n -1 ;i++){

            x = (i+1) * n;
            y = x * x;
            area += n * y;
        }
        cout << area << endl;
        area = 0;
    }


    return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include<iostream>

using namespace std;

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

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

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

int main() {
	ios :: sync_with_stdio(false);
	for(int d; cin >> d; ) {
		int ans = 0;
		for(int i = 0; i < 600; i += d)
			ans += d * i * i;
		cout << ans << '\n';	
	}
	return 0;
}

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

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

int main(void) {
    int d;
    while(cin >> d) {
        int width = d; int height = d;
        long long sum = 0;
        while(height <= 600 - d) {
            sum += width * f(height);
            height += d;
        }
        cout << sum << endl;
    }
    return(0);
}

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

int GetLowerApproximatedArea(int Delta)
{
	int SumArea = 0;
	for(int i = 0; Delta * i < 600; i++){
		SumArea += Delta * Delta * i * Delta * i;
	}
	return SumArea;
}

int main()
{
	while(true){
		int Delta;
		cin >> Delta;
		if(cin.eof() == true) break;
		cout << GetLowerApproximatedArea(Delta) << endl;
	}
	return 0;
}

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

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

int integral(int d)
{
    int area = 0;
    for (int i = 0; i < 600 / d; i++)
    {
        area += curve(d * i) * d;
    }
    return area;
}

int main()
{
    int d;
    while (cin >> d)
    {
        cout << integral(d) << endl;
    }
    return 0;
}

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

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

int main() {
  int d;
  int D = 600;
  cin >> d;
  int s = 0;
  for (int i = 1; i * d < D; i++)
    s += f(i * d) * d;

  cout << s << endl;
}

C++: #include <iostream>
 
int main(){
    int d;
     
    while(std::cin >> d){
        int sum = 0;
        for(int i = d; i < 600; i += d){
            sum += i*i*d;
        }
         
        std::cout << sum << std::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>
#include<cstdio>
#define N 600
double f(double x){
    return x*x;
}


int main(void){
    int d,i;
    double sum;    
    while(std::cin>>d){
        sum=0;
        for(int i=d;i<N;i+=d){
            sum+=f(i)*d;
        }
        std::cout<<sum<<std::endl;
    }
    return 0;
}

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

C++: #include <iostream>
//using namespace System;

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