Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	n, err := strconv.Atoi(nextString())
	return n, err
}

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

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		d, err := nextInt()
		if err != nil {
			break
		}

		area := 0
		for i := 0; i < 600/d; i++ {
			x := i * d
			area += f(x) * d
		}
		fmt.Println(area)
	}
}

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

using namespace std;

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


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

  return 0;
}

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

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

C++: #include <iostream>

using namespace std;

int main()
{
    int lub;
    int d;
    long long area;

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

    return 0;
}

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

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

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

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

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;
        
        
        }*/
        ll j=1;
        ll fd=j*n;
        while(true){
            if(fd==600)break;
            ans+=pow(fd,2)*n;
            j++;
            fd=j*n;
            
            
        }
        cout<<ans<<endl;
    }
    
    
    
    return 0;
}

C++: #include <iostream>

using namespace std;

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

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

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

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

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

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

int area(int d){
    int x, y, sum, i;
    x = 600;
    y = f(d);
    sum = 0;
    i = 1;
    while(d * i <= 600 - d){
        sum += y * d;
        i++;
        y = f(d * i);
    }
    return sum;
}

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

C++: #include <iostream>

using namespace std;

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

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


int main(){
	li d;
	
	while(cin>>d){
		li res=0;
		repp(i,1,600/d){
			res+=i*i*d*d;
			//p3(600/d,d,res);
		}
		cout<<res*d<<endl;
	}
	
	return 0;
}

C++: #include <cstdio>
#include <bitset>
#include <cmath>
#include <complex>
#include <vector>
#include <algorithm>
#include <stack>

#define EPS 1e-6

using namespace std;
typedef complex<double> coor;

double cross(coor a, coor b)
{
  return a.real() * b.imag() - a.imag() * b.real();
}

double dot(coor a, coor b)
{
  return a.real() * b.real() + a.imag() * b.imag();
}

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

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

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

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

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

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

C++: #include<iostream>

using namespace std;
int main() {
    int d;
    while(cin >> d) {
        int ans = 0;
        int x = d;
        while (x <= 600 - d) {
            ans += x * x * d;
            x += d;
        }
        cout << ans << endl;
    }
}

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;

int main(){
	ll d, s = 0;
	while (cin >> d){
		REP(i, 600 / d - 1){
			s += pow((i + 1)*d, 2)*d;
		}
		cout << s << "\n";
		s = 0;
	}
	return 0;
}

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

using namespace std;

int main() {
  int d;
  while (scanf("%d", &d) == 1) {
    int a = 0;
    for (int x = 0; x < 600; x += d)
      a += d * x * x;
    printf("%d\n", a);
  }
  return 0;
}

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

int func(int x,int d){
	return x*x*d;
}

int main(){
	int d;
	while(cin>>d){
		unsigned int S=0;
		for(int i=0;i<WIDTH;i+=d){
			S+=func(i,d);
		}
		cout<<S<<endl;
	}

}

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

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

C++: #include <iostream>


double func(double input) {
    return input * input;
}

double integral(double h, double min_x = 0, double max_x = 600) {
    double sum = 0;
    for (double x = min_x; x < max_x; x+= h) {
        sum += func(x) * h;
    }
    return sum;
}

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