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

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

C++: #include<cstdio>

int d;
int n;
int count=0;

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

C++: #include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
using namespace std;

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

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int w;
    while(scanf("%d",&w)!=EOF)
    {

        int i;
        long long area = 0;
        for(i=w;i<600;i+=w)
        {
            area += w*i*i;
        }
        printf("%lld\n",area);
    }

}

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

int main()
{
	int d;
	while(cin>>d)
	{
	long long ans = 0;
	

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

	cout << ans << endl;
	}
	return 0;
}

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

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

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

int main(){
	int d,s;

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

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

C++: #include <bits/stdc++.h>

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;
	}
}

C++: #include<iostream>

using namespace std;

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

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

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

using namespace std;

int main(void){
	int d , n;
	while(1){
		cin >> d;
		if (cin.eof())
			break;
		n=600/d;
		int s=0;
		for (int i=1; i<=n; i++){
			s += d*(i-1)*d*(i-1)*d;
		}
		cout << s << endl;
	}


	return 0;
}

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

	return 0;
}

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

int main()
{
    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++: #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
typedef long long int ll;

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

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

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

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

#define B 600

int f(int x);

using namespace std;

int main(void) {
  int d, S = 0;
  while(cin >> d) {
    for(int i = 0; i < B/d; i++) {
      S = S + d*f(i*d);
    }
    cout << S << '\n';
    S = 0;
  }

  return 0;
}

int f(int x) {
  return pow(x,2);
}

C++: #include<iostream>
#include<stdio.h>
#include<vector>
#include<math.h>

using namespace std;

int main(){
	int ret=0;
	int sum = 0;

	while (scanf("%d", &ret) != EOF){

		for (int i = 1; i*ret <= 600-ret ;i++){
			sum += pow(i*ret,2) * ret;
		}

		cout << sum << endl;

		sum = 0;
	}

	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

	int d;
	while(1){

    cin >> d;

    if(cin.fail()) break;

	int s=0;
	for(int i=1;i<600/d;i++)
	s+=d*(i*d)*(i*d);

    cout << s << endl;


	}

	return 0;
}

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

C++: #include <iostream>

using namespace std;

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

int main(int ac, char **av) {
  int d;
  while (cin >> d) {
    int a = 600 / d;
    int sum = 0;
    for (int i = 1; i < a; i++) {
      sum += f(i*d) * d;
    }
    cout << sum << endl;
  }
  return 0;
}

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

using namespace std;

int main(int argc, char const* argv[])
{
	int sum[5001];
	int n;

	while( cin >> n && n != 0 ){
		int input;
		for( int i = 0;i < 5001;i++ ) sum[i] = 0;
		cin >> input;
		sum[1] = input;
		for( int i = 2;i <= n;i++ ){
			cin >> input;
			sum[i] = input + sum[i - 1];
		}

		int answer = -10000000;

		for( int i = 1;i <= n;i++ ){
			for( int j = 0;j < i;j++ ){
				answer = max( answer, sum[i] - sum[j] );
			}
		}

		cout << answer << endl;
	}

			

	return 0;
}

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

int main()
{
  int d;
  int n;
  long square[600], s;
  int max=0;
  int i;

  square[0]=0;
  while(cin>>d){
    n=600/d-1;
    if(max<n){
      for(i=max+1; i<=n; i++){
        square[i]=square[i-1]+i*i;
      }
      max=n;
    }
    s=square[n]*d*d*d;
    printf("%ld\n", s);
  }

  return 0;
}

C++: #include<iostream>

using namespace std;

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

C++: #include <cstdio>
#include <algorithm>
#include <stack>
#include <cmath>
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 llong long long

int main() {
  int d;
  while(scanf("%d", &d) != EOF) {
    int s = 0;
    FOR(i,1,600/d) {
      s += d*(int)pow(i*d,2);
    }
    printf("%d\n",s);
  }
  return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int w;
    while(scanf("%d",&w) && w)
    {

        int i;
        long long area = 0;
        for(i=w;i<600;i+=w)
        {
            area += w*i*i;
        }
        printf("%lld\n",area);
    }

}

C++: #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
/*
long long int tks(long long int D,long long int ans){
	int y=D;
	ans+=D*D*y;
	
	


}
*/
int main(){
	
	
	int D=0;
	
	while(cin>>D){
long long int ans=0;
int y=0;
	while(1){
		y+=D;
		if(y>=600)break;
		ans+=y*y*D;
	}
	cout<<ans<<endl;}
	return 0;
}

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

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

C++: #include <iostream>

using namespace std;

int main(){
	double d;
	double sum = 0;

	while(cin >> d){

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

}