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

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

int main(void) {
  int d, sum;
  
  while(cin >> d) {
    sum = 0;
    for(int i = 1 ; (i * d) <= (600 - d) ; i++) {
      sum += f(i*d) * d; // f(i*d) ツ縦 ツ　ツ　ツ　d ツ可。
    }
    cout << sum << endl;
  }
  return 0;
}

C++: #include<stdio.h>
int main()
{
	int m,d;
	while(!(scanf("%d",&d)==EOF)){
		m=0;
		for(int i=0;(d*i)<(600-d);i++){
			m+=((i+1)*d*(i+1)*d*d);
		}
		printf("%d\n",m);
	}
	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define M_PI 3.14159265358979
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include <algorithm>

using namespace std;



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

	}
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <bitset>
#include <queue>
#include <map>
#include <string>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<long long int,long long int> 
#define ff first
#define pb push_back
#define ss second
#define ll long long 
#define ull unsigned long long
#define vi vector<long long int>
#define vii vector<pii>
#define vvi vector <vi>
#define rep(x,a,b,c) for(int x=a;x<=b;x+=c)
#define repp(x,a,b) rep(x,a,b,1)
#define rev(x,a,b,c) for(int x=a;x>=b;x-=c)
#define revv(x,a,b) rev(x,a,b,1)
#define OO (int)2e9
#define INF (ll)1e18
 
using namespace std;

int n,hasil;

int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		hasil=0;
		rep(x,n,600-n,n)
		{
			hasil+=n*x*x;
		}
		printf("%d\n",hasil);
	}
	return 0;
}

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

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

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

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;

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

	return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <memory>
#include <iomanip>
#include <numeric>
#include <functional>
#include <new>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <cctype>
#include <ctime>

#define REP(i, n) for(int (i) = 0; i < n; i++)
#define FOR(i, a, n) for(int (i) = a; i < n; i++)
#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
#define sz(n) n.size()
#define pb(n) push_back(n)
#define all(n) n.begin(), n.end()

template<typename T> T gcd(T a, T b) {
    if(!b) return a;
    return gcd(b, a % b);
}
template<typename T> T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

using namespace std;

typedef long long ll;
typedef long double ld;

int d;

int main(void) {
    for( ; ~scanf("%d", &d); ) {
        int ans = 0;

        for(int i = 0; i < 600; i += d) {
            ans += (i * i) * d;
        }

        printf("%d\n", ans);

    }
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
	int d;
	int menseki;
	while(scanf("%d",&d) !=EOF)
	{
		menseki = 0;
		for(int i = 0;i<600;i+=d)
		{
			menseki+=i*i*d;
		}
		printf("%d\n",menseki);

	}
	return 0;
}

C++: #include <stdio.h>

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

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

int main(){
cout << "azunyan" << endl;
}

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

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

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

C++: #include<bits/stdc++.h>
using namespace std;
signed main(void){
	ios::sync_with_stdio(false);
	int d,ans;
	while(cin>>d){
		ans=0;
		for(int i=0;i<600;i+=d)
			ans+=i*i*d;
		cout<<ans<<endl;
	}
}

C++: #include<iostream>
using namespace std;
int main() {
	int x, y;
	int d;
	long long cou = 0;
	while (cin >> d){
		cou = 0;
		for (int i = 0; i < 600/d; i++){
			x = i*d;
			y = x*x;
			cou += y*d;
		}
		cout << cou << endl;
	}
}

C++: #include <iostream>

using namespace std;

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

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

using namespace std;

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

C++: #include<stdio.h>
int main(){
    int a,b,i;
    while(~scanf("%d",&a)){
        b=i=0;
        for(;i<600/a;){
            b+=a*i*a*i++*a;
        }
        printf("%d\n",b);
    }
}

C++: #include <iostream>

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

C++: #include <stdio.h>

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

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

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

C++: #include <iostream>

using namespace std;

int main()
{
    int d;
    while(cin>>d){
        int i = 2;
        int x = d;
        long sum = 0;
        while(600-x>0){
            sum += x*x*d;
            x = d * i;
            i++;
        }
        cout<<sum<<endl;
        sum = 0;
    }

    return 0;
}

C++: #include <iostream>

using namespace std;

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

int main()
{
    int d;
    
    while (cin>>d)
    {
        int ans = 0;
        
        for (int i = 1; d * i < 600; i++)
        {
            ans += f(d * i) * d; // equation is informed from question
        }
        
        cout<<ans<<endl;
    }
    
    return 0;
}

C++: #include<iostream>
#include<math.h>
using namespace std;
int main(){
    int d;
    while(cin>>d){
         int a;
         a=600/d;
         int b=0;
         for(int i=0;i<a;i++){
            b+=d*i*d*i*d;
         }
         cout<<b<<endl;
    }
}

C++: #include<stdio.h>
int main()
{
int d;
int sum=0;
while(scanf("%d",&d)!=0){
sum=0;
for(int i=d;i<=600-d;i+=d){
sum+=i*i*d;
}
printf("%d",&sum)}
return 0;
}

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

int main()
{
        int div;
        ll sum;

        while(cin >> div){
                sum = 0;
                for(int i = div;i<=600-div;i+=div){
                        sum += i*i*div;
                }

                cout << sum << endl;
        }

        return 0;
}