#include <bits/stdc++.h>
using namespace std;
unsigned long long int modexpo(unsigned long long int x,
                               unsigned long long int p) {
  unsigned long long int res = 1;
  x = x % 1000000007;
  while (p) {
    if (p % 2) res = res * x;
    p >>= 1;
    x = x * x % 1000000007;
    res %= 1000000007;
  }
  return res;
}
unsigned long long int binSearch(unsigned long long int a[],
                                 unsigned long long int l,
                                 unsigned long long int h,
                                 unsigned long long int x) {
  unsigned long long int c = -1;
  while (l <= h) {
    unsigned long long int m = (l + h) / 2;
    if (a[m] < x) {
      c = m;
      l = m + 1;
    } else
      h = m - 1;
  }
  return c;
}
unsigned long long int isPrime(unsigned long long int n) {
  if (n < 2) return 0;
  if (n < 4) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (unsigned long long int i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  unsigned long long int n, t, i, q, m, ans = 0, j, k = 1, f = 0, g = 0, h = 0;
  ;
  cin >> n;
  unsigned long long int a[n + 2], prev[n + 2];
  a[1] = 2;
  prev[1] = 2;
  for (i = 2; i < n + 1; i++) {
    k = (i + 1) * i;
    a[i] = k * (i + 1) - (prev[i - 1]) / i;
    prev[i] = k;
  }
  for (i = 1; i < n + 1; i++) {
    cout << a[i] << endl;
  }
  return 0;
}
