Plus and Square Root CodeForces - 716C

传送门

A. Plus and Square Root

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

ZS the Coder is playing a game. There is a number displayed on the screen and there are two buttons, ' + ' (plus) and '' (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 :

1. 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.
2. Press the '' button. Let the number on the screen be x. After pressing this button, the number becomes . 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² 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 '' 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 '' button n times. Help him determine the number of times he should press the ' + ' button before pressing the '' 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 '' button at level i.

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

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

对我还是很难的，分析能力渣渣。

假设当前 阶层的最后一个值为 a[i],也就是说可以开方了，所以 a[i]=(i+1)^2*c, c也一定是一个m^2,要不就不能开方了，

所以我们看到 i+1层的值是，（i+1)的倍数，有因为在i+1层的都是 i+1的倍数，说明 i+1层的最后一个数一定也是（i+1）的倍数，所以对于i层的同理，也就是说 i层的最后一个数也是i的倍数， 也就是a[i]是i的倍数，所以c 可以写作i^2*c,

所以呢 a[i]=i*i*(i+1)*(i+1) ,那么i+1层的第一个数就是 i(i+1),同理的 第i层的 第一个数为 (i-1)*i,

所以答案就是  (i*i*(i+1)*(i+1)-(i-1)*i)/i,  化简 的 i*(i+1)*(i+1)-(i-1)

#include<cstdio>
#include<cstring>

using namespace std;
typedef unsigned long long ll;


int main(){
	ll n;
	scanf("%llu",&n);
	printf("2\n");
	if(n==1)
		return 0;
	for(ll i=2;i<=n;i++){
		printf("%llu\n", i*(i+1)*(i+1)-(i-1));
	}
	return 0;
}