【33.17%】【Codeforces 715A】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 becomesx + 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 = m2 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 ntimes. 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 1018. However, the number on the screen can be greater than 1018.

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 became2 + 14·1 = 16. Then, ZS the Coder pressed the '' button, and the number became .

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

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

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 becomes6 + 10·3 = 36, and when the '' button is pressed, the number becomes  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 = 1018. Then, ZS the Coder pressed the '' button, and the number became .

After that, on the second level, ZS pressed the ' + ' button 44500000000 times, so the number becomes109 + 44500000000·2 = 9·1010. Then, ZS pressed the '' button, levelling up and changing the number into .

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

【题解】

数学题。

题意就是

a[i] + ans[i]*i = a[i+1]^2

然后移项一下

ans[i] = (a[i+1]^2-a[i])/i; ·······①

这里的ans[i]要求是整数

同时已知a[i] % i == 0

则我们要让a[i+1] % i == 0才行

构造！

构造a[i]= i*(i-1)

这样的话就能满足a[i] % i ==0 且 a[i+1] %i ==0

代入①式。

则ans[i] = (i+1)^2*i-(i-1);····③

但是还有个问题

给的初始数字是2

一开始i=1，但是a[i] = 2 不等于i*(i-1)==0

那我们就看一下i=2.

i*(i-1) == 2

而我们是可以先让第一个2加上2然后变成4.

这样a[2]就满足等于根号4等于2了。

这样a[2]就满足i*(i-1)了

那之后就简单了

a[3] = 3*(2) == 6;

。。。

那我们的③式就可以用了。

即:

第一项输出2.让a[2]满足a[2] = 2*1 ------i*(i-1)

从第二项之后直接输出ans[i]；

中间计算可能会溢出要小心(long long)

【代码】

#include <cstdio>

int n;

void input_data()
{
	scanf("%d", &n);
}

void get_ans()
{
	for (int i = 1; i <= n; i++)
		if (i == 1)
			printf("2\n");
		else
			printf("%I64d\n", long long(i + 1)*(i + 1)*i - (i - 1));
}

int main()
{
	//freopen("F:\\rush.txt", "r", stdin);
	//freopen("F:\\rush_out.txt", "w", stdout);
	input_data();
	get_ans();
	return 0;
}