#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 17;
const int magic = (1 << 7);
using namespace std;
struct p {
  long double x, y;
  p(long double x, long double y) : x(x), y(y) {}
  p() {}
  long double len() const { return sqrt(x * x + y * y); }
};
p operator-(const p &a, const p &b) { return p(a.x - b.x, a.y - b.y); }
string s;
bool solve(int l, int r) {
  int q = 0;
  map<char, int> c;
  int num = 0;
  for (int i = l; i <= r; i++) {
    if (s[i] == '?')
      q++;
    else
      c[s[i]]++;
  }
  if (c.size() + q >= 26) {
    for (int i = l; i <= r; i++) {
      if (s[i] == '?')
        for (int x = int('A'); x <= int('Z'); x++) {
          if (c[char(x)] == 0) {
            s[i] = char(x), c[char(x)]++;
            break;
          }
        }
    }
    return true;
  }
  return false;
}
int main() {
  if (1) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
  }
  long long n;
  cin >> n;
  long long cur = 2;
  for (long long i = 1; i <= n; i++) {
    cout << (i * (i + 1) * (i + 1) - cur / i) << '\n';
    cur = i * (i + 1);
  }
  return 0;
}
