#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <cassert> #include <iostream> #include <algorithm> #include <stack> #include <queue> #include <vector> #include <set> #include <map> #include <bitset> using namespace std; #define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define rep(i,n) repl(i,0,n) #define mp(a,b) make_pair(a,b) #define pb(a) push_back(a) #define all(x) (x).begin(),(x).end() #define dbg(x) cout<<#x"="<<x<<endl #define fi first #define se second #define INF 2147483600 long calc(long d) { return (long)((-1 + sqrt(1 + 4*d)) / 2.0); } int main(){ int cnt=0; long n=999999999; while(cnt<100000 && n>=0){ long m = n*n+n; long r = m-1; while(calc(r) == n){ printf("%ld\n", r); r--; cnt++; } n--; } return 0; }