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

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

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

LL calc(LL d) {
  return (LL)((-1 + sqrt(1 + 4*d)) / 2.0);
}
LL solve(LL d){
  LL lb = 0, ub = 1e9+10;
  while(ub-lb>1){
	LL m = (lb + ub) / 2;
	if(m*m+m <= d) lb = m;
	else ub = m;
  }
  return lb;
}


int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  random_device rnd;

  const LL mod = 1e9;
  set<LL> ans;
  LL d;
  for(;;){
	d = (rnd() % mod);
	d = d*d + d - 1;
	if(calc(d) != solve(d)){
	  for(LL t=d;t>0;--t){
		if(ans.count(t) || calc(t) == solve(t))
		  break;
		else
		  ans.insert(t);
	  }
	  for(LL t=d+1;t<mod*mod;++t){
		if(ans.count(t) || calc(t) == solve(t))
		  break;
		else
		  ans.insert(t);
	  }
	  //cout << SZ(ans) << endl;
	}
	if(SZ(ans) > 100000) break;
  }

  int cnt = 0;
  for(auto it=begin(ans);;++it){
	cout << *it << endl;
	if(++cnt == 100000) break;
  }

  return 0;
}