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 <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <iomanip>
#pragma comment(linker, "/STACK:836777216")

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;

#define pb push_back
#define mp make_pair
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define FORD(i,a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-7
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(n) ((n) * (n))

int main(void) {
  int d;
  while (scanf("%d", &d) == 1) {
    ll ans = 0;
    FOR(i, 1, 600 / d) {
      ans += (ll)d * sqr(i * d);
    }

    printf("%lld\n", ans);
  }
}

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

C++: #include<stdio.h>

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

C++: #include<iostream>

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

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

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

using namespace std;

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

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
  int d,s;
  int S = 0;
  int n = 20;
  int y,x;
  while(n > 0){
    cin >> d;
    // int y = x * d;
    for(y < 600-d;y++;){
      int x[1000]; 
      int y = x * d;
    int s = y * d;
    int n = n - 1;
    int S = S + s;
  }
    cout << S << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include<iostream>
int main(){int a=0,d,i;while(std::cin>>d){for(i=a=0;i<600;i+=d){a+=i*i*d;}std::cout<<a<<"\n";}}

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

using namespace std;

int d,integ;

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

C++: <?php
while($a=trim(fgets(STDIN))){
        $ans=0;
        for ($i=0; $i < 600; $i+=$a) {
                $ans+=$i*$i*$a;
        }
        echo $ans.PHP_EOL;
}

C++: #include <bits/stdc++.h>  
 
using namespace std;
 
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

int main() {
	int N;
	while(cin >> N) {
		int d = N;
		int cnt = 1;
		int ans = 0;
		while(1) {
			if(d * cnt == 600 - N) {
				ans += d * cnt * d * cnt * N;
				break;
			}
			ans += d * cnt * d * cnt * N;
			++cnt;
		}
		cout << ans << endl;
	}
	return 0;
}

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

C++: #include <stdio.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

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

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

int main()
{
	int d;

	while(cin >> d)
	{
		int value=0,s=0;

		while(value != 600-d)
		{
			value += d;
			int line = value*value;
			s += line*d;
		}

		cout << s << endl;
	}

	return 0;
}

C++: #include<iostream>
using namespace std;
int f(int x){
    return x*x;
}
int g(int k,int d){
    int s = f(k*d) * d;
    //cout << s <<endl;
    return s;
}
int main(){
    int n = 0;
    int d[20];
    int s[20];
    while(cin >> d[n]){
        n++;
    }
    for(int i = 0;i < n ;i++){
        s[i] = 0;
        for(int j = 1;j < 600 / d[i] ;j++ ){
            s[i] += g(j,d[i]);
        }
        cout << s[i] << endl; 
    }
    return 0;

}

C++: //#define _USE_MATH_DEFINES
#include <iostream>
//#include <stdio.h>
//#include <iomanip>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <functional>
//#include <cmath>
//#include <time.h>

using namespace std;


int main(){

	int d,x,y,S;


	while (cin >> d){
		S = 0;
		x = 0;
		while (x < 600 -d){
			x += d;
			y = x*x;
			S += d * y;
		}
		cout << S << endl;
	}

	return 0;
}

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

using namespace std;

int main() {
  int d, sum;
  while(!feof(stdin)) {
    scanf("%d", &d);
    if(feof(stdin)) break;
    sum=0;
    for(int i=d;i!=600;i+=d) {
      //printf("%d\n", i*i*i*d);
      sum+=d*i*i;
    }
    printf("%d\n", sum);
  }
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>

using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()

#define rep(i,n) for(int i = 0; i < (n);++i)
#define repc(i,a,b) for(int i = (a);i <(b);++i)
#define repa(n,array) for(auto n :(array))

typedef long long ll ;
typedef vector<int> vi ;
typedef vector<ll> vl ;

constexpr int IMAX = ((1<<30)-1)*2+1 ;
constexpr int INF = 100000000;
double EPS = 1e-10 ;

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

  return 0;
}