ZS the Coder is playing a game. There is a number displayed on the screen and there are two buttons, ' + ' (plus) and '$\sqrt{}$' (square root). Initially, the number 2 is displayed on the screen. There are n + 1 levels in the game and ZS the Coder start at the level 1.

When ZS the Coder is at level k, he can :  Press the ' + ' button. This increases the number on the screen by exactly k. So, if the number on the screen was x, it becomes x + k. Press the '$\sqrt{}$' button. Let the number on the screen be x. After pressing this button, the number becomes $\sqrt{x}$. After that, ZS the Coder levels up, so his current level becomes k + 1. This button can only be pressed when x is a perfect square, i.e. x = m^2 for some positive integer m. 

Additionally, after each move, if ZS the Coder is at level k, and the number on the screen is m, then m must be a multiple of k. Note that this condition is only checked after performing the press. For example, if ZS the Coder is at level 4 and current number is 100, he presses the '$\sqrt{}$' button and the number turns into 10. Note that at this moment, 10 is not divisible by 4, but this press is still valid, because after it, ZS the Coder is at level 5, and 10 is divisible by 5.

ZS the Coder needs your help in beating the game — he wants to reach level n + 1. In other words, he needs to press the '$\sqrt{}$' button n times. Help him determine the number of times he should press the ' + ' button before pressing the '$\sqrt{}$' button at each level. 

Please note that ZS the Coder wants to find just any sequence of presses allowing him to reach level n + 1, but not necessarily a sequence minimizing the number of presses.


-----Input-----

The first and only line of the input contains a single integer n (1 ≤ n ≤ 100 000), denoting that ZS the Coder wants to reach level n + 1.


-----Output-----

Print n non-negative integers, one per line. i-th of them should be equal to the number of times that ZS the Coder needs to press the ' + ' button before pressing the '$\sqrt{}$' button at level i. 

Each number in the output should not exceed 10^18. However, the number on the screen can be greater than 10^18.

It is guaranteed that at least one solution exists. If there are multiple solutions, print any of them.


-----Examples-----
Input
3

Output
14
16
46

Input
2

Output
999999999999999998
44500000000

Input
4

Output
2
17
46
97



-----Note-----

In the first sample case:

On the first level, ZS the Coder pressed the ' + ' button 14 times (and the number on screen is initially 2), so the number became 2 + 14·1 = 16. Then, ZS the Coder pressed the '$\sqrt{}$' button, and the number became $\sqrt{16} = 4$. 

After that, on the second level, ZS pressed the ' + ' button 16 times, so the number becomes 4 + 16·2 = 36. Then, ZS pressed the '$\sqrt{}$' button, levelling up and changing the number into $\sqrt{36} = 6$.

After that, on the third level, ZS pressed the ' + ' button 46 times, so the number becomes 6 + 46·3 = 144. Then, ZS pressed the '$\sqrt{}$' button, levelling up and changing the number into $\sqrt{144} = 12$. 

Note that 12 is indeed divisible by 4, so ZS the Coder can reach level 4.

Also, note that pressing the ' + ' button 10 times on the third level before levelling up does not work, because the number becomes 6 + 10·3 = 36, and when the '$\sqrt{}$' button is pressed, the number becomes $\sqrt{36} = 6$ and ZS the Coder is at Level 4. However, 6 is not divisible by 4 now, so this is not a valid solution.

In the second sample case:

On the first level, ZS the Coder pressed the ' + ' button 999999999999999998 times (and the number on screen is initially 2), so the number became 2 + 999999999999999998·1 = 10^18. Then, ZS the Coder pressed the '$\sqrt{}$' button, and the number became $\sqrt{10^{18}} = 10^{9}$. 

After that, on the second level, ZS pressed the ' + ' button 44500000000 times, so the number becomes 10^9 + 44500000000·2 = 9·10^10. Then, ZS pressed the '$\sqrt{}$' button, levelling up and changing the number into $\sqrt{9 \cdot 10^{10}} = 300000$. 

Note that 300000 is a multiple of 3, so ZS the Coder can reach level 3.

Difficulty: competition

Starter code:

Solutions:
"""
Codeforces Round 372 Div 1 Problem A

Author  : chaotic_iak
Language: Python 3.5.2
"""

################################################### SOLUTION

def main():
    n, = read()
    curr = 2
    for lv in range(1, n+1):
        tgt = (lv*(lv+1))**2
        print((tgt - curr) // lv)
        curr = lv*(lv+1)
    return

#################################################### HELPERS

def read(typ=int):
    # None: String, non-split
    # Not None: Split
    input_line = input().strip()
    if typ is None:
        return input_line
    return list(map(typ, input_line.split()))

def write(s="\n"):
    if s is None: s = ""
    if isinstance(s, list): s = " ".join(map(str, s))
    s = str(s)
    print(s, end="")

write(main())



N = int(input())

x = 2

for i in range(1, N+1):
    u, v = i, i+1
    p = u**2 * v**2
    d = p - x
    z = d // u
    assert(z <= 10**18)
    print(z)
    x = u*v


N = int(input())
print(2)
for n in range(2, N+1):
	clicks = n*(n+1)**2 - (n-1)
	print(clicks)

n = int(input())
a = 2
for i in range(1, n + 1):
  b = (i * (i + 1)) * (i * (i + 1))
  assert (b - a) % i == 0, str(i)
  c = (b - a) // i
  print(c)
  a = i * (i + 1)


n=int(input())
ret=2
q=2
for k in range(1,n+1):
    if(q%(k+1)!=0):
        q+=k+1-(q%(k+1))
    while 1:
        w=q*q
        if (w-ret)%k==0:
            print((w-ret)//k)
            ret=q
            break
        q+=k+1




n = int(input())
print(2)
for i in range(1, n):
    print((i+2)*(i+2)*(i+1)-i)


#!/usr/bin/env python3
import math
n = int(input())
x = 2
k = 1
while k <= n:
    assert x % k == 0
    y = ((k+1) * k) ** 2
    assert x <= y and (y - x) % k == 0
    assert (y - x) // k <= 10**18
    print((y - x) // k)
    x = (k+1) * k
    k += 1


def solve(x):
	return ((((x + 1) ** 2) * (x ** 2)) - (x * x - x)) / x
 
inp = int(input(""))
lvl = 1
print ("2")
while(inp >= 2):
	ops = solve(lvl + 1)
	print (int(ops))
	lvl = lvl + 1
	inp = inp - 1 

import sys
from fractions import gcd
import math
def lcm(x, y):
    return x * y // gcd(x, y)

def seive(lim):
    for x in range(2, lim + 1):
        if (len(factors[x]) == 0):
            factors[x].append((x, 1))
            for y in range(x + x, lim + 1, x):
                yy = y
                cnt = 0
                while (yy % x == 0):
                    cnt += 1
                    yy //= x
                factors[y].append((x, cnt))
factors =[]
for i in range(10**5 + 2):
    factors.append([])
seive(10**5 + 1)
n = int(input())
curLvl = 1
curValue = 2
nxtLvl = 2
ans = ""
while (curLvl <= n):
    f = factors[curLvl]
    x = 1
    for item in f:
        x *= item[0] ** (item[1] // 2 + item[1] % 2)
    x = lcm(x, nxtLvl)
    ans += str((x * x - curValue) // curLvl) + "\n"
    curValue = x
    curLvl += 1
    nxtLvl += 1

sys.stdout.write(ans)








n = int(input())
st = 2
def sqrt(x):
    lo = 0
    hi = 1000000000000
    while (lo < hi):
        mid = (lo + hi) // 2
        if mid*mid < x:
            lo = mid + 1
        else:
            hi = mid
    return lo

for i in range(1, n+1):
    a = ((i*(i+1))**2-st)/i
    a = int(a)
    print(a)
    st += i*a
    st = sqrt(st)

n = int(input())
st = 2
def sqrt(x):
    lo = 0
    hi = x
    while (lo < hi):
        mid = (lo + hi) // 2
        if mid*mid < x:
            lo = mid + 1
        else:
            hi = mid
    return lo

for i in range(1, n+1):
    a = ((i*(i+1))**2-st)/i
    a = int(a)
    print(a)
    st += i*a
    st = sqrt(st)


n = int( input() )
print( 2 )
for i in range(2, n+1):
  print( ( i + 1 ) * ( i + 1 ) * i - ( i - 1 ) )


n = int(input())
cur = 2
for i in range(1,n+1):
	tmp = ((i*(i+1))**2 - cur)/i;
	tmp = int(tmp)
	print(tmp)
	cur = i*(i+1)


#!/usr/bin/env	python
#-*-coding:utf-8 -*-
print(2)
n=int(input())
for i in range(2,1+n):print(1+i*(2+i)*i)


#!/usr/bin/env	python
#-*-coding:utf-8 -*-
print(2)
for k in range(2,1+int(input())):print(1+k*(2+k)*k)


a=2
n=0
max = int(input())
for k in range(max+1):
    if(k==0):
        continue
    n = k*(k+1)*(k+1)-a
    a=k
    print(n)


N = int(input())
tmp1 = 2
tmp2 = 2
for i in range(1, N + 1):
    if i == 1:
        print(2)
        tmp2 *= 3
    else:
        print((tmp2 ** 2 - tmp1) // i)
        tmp1 = tmp2
        tmp2 //= i
        tmp2 *= (i + 2)


import math

n = int(input())
x = 2
for i in range(1, n+1):
    y = i * (i + 1)
    y *= y
    print(round((y-x)/i))
    x = math.sqrt(y)


n = int(input())
print(2)
for i in range(2, n+1):
    print(i*(i+1)*(i+1) - i+1)


n = int(input())
for i in range(2,n+2):
    if i==2:
        print(2)
    else:
        print(i*i*(i-1)-(i-2))

"""
upsolving:
brute forcing takes too long
parlay congruence relation
"""

import math

n = int(input())
zs = 2

for lvl in range(1, n+1):
    print(((lvl * (lvl + 1)) ** 2 - zs) // lvl)
    zs = lvl * (lvl + 1)


#!/usr/bin/env	python
#-*-coding:utf-8 -*-
for k in range(2,1+int(input('2\n'))):print(1+k*(2+k)*k)


n = int(input())
print(2)
for i in range(2, n+1):
    print(i*(i+1)*(i+1) - i+1)

print(2)
for i in range(2, int(input())+1):
 print(i*i*i+2*i*i+1)