#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>

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

using namespace std;

typedef long long ll;

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

int bs(ll d){
	int l = 0, r = 1e9 + 1;
	while(r - l > 1){
		int m = (l + r) / 2;
		if(ll(m) * m + m <= d){
			l = m;
		}
		else{
			r = m;
		}
	}
	return l;
}

int main(){
	int cnt = 0;
	rep(i, 1e6){
		ll k = 1e9 - i - 1;
		k = k * k + k - 1;
		if(calc(k) != bs(k)){
			cout << k << endl;
			++cnt;
		}
		if(cnt == 100000){
			break;
		}
	}
	return 0;
}