#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 100000;
int n;
int pmx[MAXN + 1];
void run() {
  scanf("%d", &n);
  memset(pmx, -1, sizeof(pmx));
  for (int i = (2); i <= (n); ++i)
    if (pmx[i] == -1)
      for (int j = i; j <= n; j += i) pmx[j] = i;
  long long q = 2;
  for (int k = (1); k <= (n); ++k) {
    long long y = 1;
    for (int z = k; z != 1;) {
      int p = pmx[z], cnt = 0;
      while (pmx[z] == p) z /= p, ++cnt;
      for (int i = (0); i < ((cnt + 1) / 2); ++i) y = y * p;
    }
    assert((y * y) % k == 0);
    long long x = y * y / k * (k + 1) * (k + 1) - q;
    printf("%lld\n", x);
    q = y;
  }
}
int main() {
  run();
  return 0;
}
