#include <bits/stdc++.h>
using namespace std;
long long n, ans[1000005];
long long gcd(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  if (a < b)
    swap(a, b);
  else
    return gcd(b, a % b);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  ans[2] = 2;
  long long cur = 2;
  for (long long i = 3; i <= n + 1; ++i) {
    long long nxt = ((i - 1) * i), val = gcd(i, i - 1);
    nxt /= val;
    ans[i] = ((nxt) / (i - 1)) * nxt - cur / (i - 1);
    cur = nxt;
  }
  for (long long i = 1; i <= n; ++i) cout << ans[i + 1] << endl;
}
