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>

int integrateX2(int d) {
	static const int iBegin = 0, iEnd = 600;
	int sum = 0;
	for (int x = iBegin; x < iEnd; x += d) {
		sum += x * x * d;
	}
	return sum;
}

int main() {
	int d;
	while (std::cin >> d) {
		std::cout << integrateX2(d) << '\n';
	}
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<string>
using namespace std;

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

C++: #include<iostream>
#include<cstdio>
#define N 600
int f(int x){
    return x*x;
}


int main(void){
        int d,i;
        int 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>
using namespace std;
int main()
{
	int d;
	while(cin >> d){
		int sum = 0;
		for(int i=1; i*d<600; i++){
			sum+= (i*d)*(i*d)*d;
		}
		cout << sum << endl;
	}
	return 0;
}

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

int main()
{
  int d;

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

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

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

void solve(int n) {
  int ans = 0;
  int high = 0;
  int c = n;
  while(c < 600) {
    high = c * c;
    ans += high * n;
    c += n;
  }
  cout << ans << endl;
}

int main(void) {

  int n;
  while(cin >> n) {
    solve(n);
  }
  return 0;
}

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

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(void){
	int n;
	int sum;
	int i;
	while(1){
		cin>>n;
		if(cin.eof())	break;
		sum=0;
		for(i=n;i<=600;i+=n){
			sum+=n*pow((i-n),2);
		}
		cout<<sum<<endl;
	}
	return 0;
}

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

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

int main(void){
    int d;
    while(scanf("%d", &d) != EOF) {
       printf("%d\n", area(d));
    }
    return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main(void){
    // Your code here!
    int d, S, i;
    while(scanf("%d" , &d) != EOF){
        S=0;
        for(i=1; i<600/d; i++){
            S = S + d * pow(i * d, 2);
        }
        cout << S << endl;
    }
    return 0;
}

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

int main(void) {
    unsigned d, x, s;
    while(cin >> d) {
        x = 0; s = 0;
        while(x < 600) {
            s += x * x * d;
            x += d;
        }
        cout << s << endl;
    }
}

C++: /*Filename: aoj0014.cpp
 *Author: Mushiyo
 */

#include <iostream>

using namespace std;

int main(){
	int d = 0;

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

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

	return 0;
}

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

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

int main(void){
	int n;

	while (cin>>n){
		double s=0;
		for (int i=n; i<600; i+=n)
			s += i*i*n;
		cout<<fixed<<setprecision(0)<<s<<endl;
	}
    return 0;
}

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

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

C++: #include <iostream>

using namespace std;

typedef long long ll;

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

C++: #include <iostream>

using namespace std;

int main(void){
	int d;
	int steps;
	int i;
	int ans=0;

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

	return 0;
}

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

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

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

C++: #include<bits/stdc++.h>
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>
#include <vector>
using namespace std;



int main(){
	
	long int d,square,height;
	long int elem,sum;

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

	return 0;
}

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = n;i >= m;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define ALL(n) n.begin(),n.end()
int dp[1100][1100];

int main() {
	ll n,ans;
	while (cin >> n) {
		ans = 0;
		REPO(i, (600 - n) / n) ans += i * n* i* n * n;
		cout << ans << endl;
	}
}

C++: #include<iostream>
using namespace std;
int n;
int a[1000000];
int sum[1000000];
int main(int argc, char const *argv[])
{

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

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

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

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

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
	int d;
	while(cin>>d){
		int ans;
		int temp=d;
		for(ans=0;d<600;d=d+temp){
			ans+=temp*pow(d,2);
		}
		cout<<ans<<endl;
	}
	
	
	return 0;
}

C++: #include<stdio.h>

int main(){
  int d,i,l,m,n,S=0;
  scanf("%d",&d);
  m = 600/d;
  n=d;
  for(i=1; i<m;i++){
    l=n*n;
    S = S+l*d;
    n = n+d;
  }
  printf("%d\n",S);
  return 0;
}