package yukicoder;
import java.util.Scanner;
public class Main{
	public static void main(String[] args){
		new Main().solve();
	}
	void solve(){
		int count=0;
		for(long i=1_000_000_000L;i>=0;i--){
			long d=i*(i+1);
			if(!iscorrect(d,calc(d))&&d<=1_000_000_000_000_000_000L){
				System.out.println(d);
				count++;
				if(count==1_000_00)return;
			}
		}
	}
	boolean iscorrect(long d,long ans){
		if(ans*ans+ans<=d&&(ans+1)*(ans+1)+ans+1>d){
			return true;
		}else return false;
	}
	long calc(long d){
		return (long)(-1+Math.sqrt(1+4*d)/2.0);
	}
	double calc_ori(long d){
		return (-1+Math.sqrt(1+4*d)/2.0);
	}
}