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++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

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

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

C++: #include<cstdio>

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

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define mp make_pair
typedef long long ll;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

ll gcd(ll a,ll b){
    if(a<b){
        int t=a;a=b;b=t;
    }
    int c=a%b;
    while(c!=0){
        a=b;
        b=c;
        c=a%b;
    }
    return b;
}

ll lcm(ll a,ll b){
    return a*b/gcd(a,b);
}

bool isPrime(int x){
    if(x==1)return false;
    if(x==2)return true;
    if(x%2==0)return false;
    for(int i=3;i<=sqrt(x);i+=2){
        if(x%i==0)return false;
    }
    return true;
}

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

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;

#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i, a, cont, next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i, a, b, step) repfn(i, a, i < b, i + step)
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

int main(int argc, char **argv)
{
  int d;
  while (cin >> d) {
    int total=0;
    repby (i, d, 600, d) {
      total += i*i*d;
    }
    cout << total << endl;
  }
  return 0;
}

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

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

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

C++: #include <bits/stdc++.h>
using namespace std;
 
#define MOD 1000000007
#define INF  2000000000
//#define int ll
#define ll long long
#define ld long double
#define vi vector<int>
#define pa pair<int, int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC(type, c, n) vector<type> c(n);for(auto& i:c)cin>>i;
#define MAT(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
 
#define BR cout << "\n";
#define SP cout << " ";
#define ENDL cout<<endl;
#define OUT(d) cout<<(d);
#define OUTL(d) cout<<(d); BR;
#define YES OUTL("YES")
#define Yes OUTL("Yes")
#define NO OUTL("NO")
#define No OUTL("No")
#define RET return 0;
#define SUM(a, n) accumulate(a, a+n, 0)
#define VSUM(v) accumulate(ALL(v), 0);
 
#define REP(i, n) for(int i=0;i<(n);i++)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define FOR(i, m, n) for(int i = m;i < n; i++)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define AREP(a, n) for(auto (a):(n))
#define ALL(a) (a).begin(),(a).end()
#define IN(n, a, b) ((a)<=(n)&&(n)<(b))

signed main(){ INIT;
    int a;
    while(cin >> a){
        int ans = 0;
        for(int i = 0; i < 600; i+= a){
            ans += a * i * i;
        }
        OUTL(ans);
    }
RET;}

C++: #include <iostream>

using namespace std;

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

int main()
{
	solve();
	return(0);
}

C++: #include<cstdio>

using namespace std;

signed main(){
    int ret = 0, d;
    while( scanf( "%d", &d ) != EOF ){
        int m = 600 / d;
        ret = m * ( m - 1 ) * ( 2 * m - 1 ) / 6 * d * d * d;
        printf( "%d\n", ret );
    }
    return 0;
}

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

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

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

using namespace std;

int main()
{
	int d;

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

	return 0;
}

C++: #include<stdio.h>

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

}

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

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

C++: 
#include <stdio.h>

#define MAX 600

int function(int d)
{
	d = d * d;
	return d;
}

int main()
{
	int d,cnt;
	int sum;
	while ((scanf_s("%d", &d)) != EOF)
	{
		sum = 0;
		cnt = MAX / d;
		for (int i = 1; i < cnt; i++)
		{
			sum += function(d*i)*d;
		}
		printf("%d\n",sum);
	}
	return 0;
}