#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

ll calc(ll d) {
	return (ll)((-1 + sqrt(1 + 4.0 * d)) / 2.0);
}

bool check(ll n) {
	ll t = calc(n);
	return t * t + t > n || (t + 1) * (t + 1) + (t + 1) <= n;
}

ll sq(int x) { return (ll)x * x; }

int main() {
	vi ds;
	rer(x, -256, 256)
		ds.push_back(x);
	int num = 0;
	for(int s = 759250124 * 2; ; ++ s) {
		for(int d : ds) {
			ll n = sq(s) / 4 - 1 + d;
			if(check(n)) {
				printf("%lld\n", n);
				if(++ num == 100000)
					return 0;
			}
		}
	}
	return 0;
}