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 main() {

  int d;
  while( cin >> d ) {

    long long int s = 0;

    for ( int i = 0; i < 600/d; i++ ) {

      int x = i * d;
      s += x*x*d;

    }

    cout << s << endl;

  }

  return 0;

}

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

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

C++: #include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

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

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);


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

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

C++: #include <iostream>

using namespace std;


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

C++: def f(x)
  x * x
end

l = gets.chomp.to_i
a = 600
p = l
sum = 0
while a >= p
  sum += l * f(p)
  p += l
end
puts sum

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

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

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

int main()
{
	int x=600, d;

	while(cin>>d){
		int n=x/d;
		cout<<"n="<<n<<endl;
		long sum=0; //d^2+(2d)^2+(3d)^2+...
		for(int i=0;i<n;++i){
			sum+=((i*d)*(i*d));
			cout<<sum<<endl;
		}
		cout<<sum*d<<endl;
	}
	return 0;
}

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);
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

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

}

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

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

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

C++: #include<stdio.h>

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

C++: #include <stdio.h>

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

    printf("%d\n", area);
  }

  return 0;
}

C++: #include<iostream>

using namespace std;

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

C++: <?php  
$range = trim(fgets(STDIN));  
$sum;
for($i = $range; $i <= 600; $i+=$range){
	$sum+=$i;
}
echo $sum;
?>

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

C++: #include<iostream>

using namespace std;

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

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

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

int main(){
	int d;
	int n;


	while (scanf("%d",&d) != EOF){
		n = 600 / d;
		int sum = 0;

		for (int i = 0; i < n; i++){
			int f;
			f = (i*d)*(i*d);
			sum += f*d;
		}
		cout << sum << endl;
	}
	return 0;

}

C++: #include <stdio.h>

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

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

int main()
{
  int d;

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

C++: #include<iostream>

using namespace std;

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