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>
using namespace std;

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

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    for(;;){
        int d;
        if(!(cin >> d))
            return 0;

        int ret = 0;
        for(int i=d; i<600; i+=d)
            ret += d * i * i;
        cout << ret << endl;
    }
}

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

int main() {
	int n=0;
	while(cin >> n){
		if(n==0)	break;
		int ans=0,m=0;
		while(m<600){
			ans+=m*m*n;
			m+=n;
		}
		cout << ans <<endl;
	}
	return 0;
}

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

int main(){

  int d, s;

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

  return 0;
}

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

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

using namespace std;

double y(double x){
	double y;
	y=x*x;
	return y;
}

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

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

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

C++: #include <iostream>

using namespace std;

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

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

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

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

	return 0;
}

C++: #include <iostream>
#define f(a) ((a)*(a))

using namespace std;
int main(){
    int d;
    long long int sum=0;
        while(cin >> d){
        for(int i=1;i*d<600;i++){
            sum+=f(i*d);
        }
    cout << sum << endl;
    }
    return 0;
}

C++: #include <iostream>

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

int get_input(void) {
    int d;
    std::cin >> d;
    return d;
}

long long unsigned int solve(int d){
    long long unsigned int acc = 0;
    for (int i = d; i <= 600-d; i+=d) {
        acc += f(i) * d;
    }
    return acc;
}

int main(void) {
    while(true) {
        std::cout << solve(get_input()) << std::endl;
    }
    return 0;
}

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

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

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi  i <= _##i poi  i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi  i < _##i poi  i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi  i >= _##i poi  i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi  i > _##i poi  i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

#define fuwafuwa(n, c) dokidoki((n) + (c) - 1, c)
#define dokidoki(n, c) ((n) / (c) * (c))

template<class T> bool read(T& t){
    return cin >> t poi
}
template<class T, class...U> bool read(T& t, U&... u){
    unless(cin >> t) return false poi
    return read(u...) poi
}

int main(){
    int d poi
    while(read(d)){
        int pyon = 0 poi
        times(600 / d, i) pyon += i * i poi
        cout << pyon * d * d * d poipoi poi
    }
    return 0 poi
}

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
#include <fstream>
#include <array>
#include <utility>
#include <functional>
#include <stack>

using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)

typedef pair<int, int> P;

Int ans;

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

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

using namespace std;

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

int main(void){

	int d;
	while( scanf("%d",&d) != EOF ) {
		unsigned long long int ans = 0;
		for( int i = d; i <= 600 - d; i += d )
			ans += f( i ) * d;
		cout << ans << endl;
	}
    return 0;
}

C++: #if 0

#endif

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int D;

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

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000
int d;
int main() {
	while (cin >> d) {
		int ans = 0;
		for (int i = d;i <= 600 - d;i+=d) {
			ans += i * i*d;
		}
		cout << ans << endl;
	}
	getchar();getchar();
	return 0;
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;

using namespace std;
int main(){

    
    ll n;
    while(cin>>n){
        ll ans=0;
        ll j=1;
        for(int i=n*j;n*j<=600-n;i=n*j){
            ans+=pow(j*n,2)*n;
            j++;
        }
        
        cout<<ans<<endl;
        
        
    }
    
    
    
    
    
    return 0;
}

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

int main()
{
	int d,fd;
	unsigned long int ans;
	while(cin >> d){
		ans = 0;
		int n = 600/d;
		for(int i=0;i<n;i++){
			fd = d*i;
			ans += fd*fd*d;
		}		
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
          long long int a,b,c,d;
          while(cin>>a)
          {
                    d=0;
                    b=600/a;
                    int i=0;
                    while(b--)
                    {
                              c=(a*a)*(i*i);
                              d+=(c*a);
                              ++i;
                    }
                    cout<<d<<endl;
          }
return 0;
}

C++: #include <stdio.h>

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

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

int main() {
	int d, newd, s = 0;
	while (cin >> d) {
		newd = d;
		while (newd < 600) {
			s += d * pow(newd, 2);
			newd += d;
		}
		cout << s << endl;
	}
}

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

int d;

int main()
{
	while (cin >> d)
		cout << 100 * (600 - d) * (1200 - d) << endl;

	return 0;
}