Codeforces 877(#442 Div.2) C. Slava and tanks

 

C. Slava and tanks

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Slava plays his favorite game "Peace Lightning". Now he is flying a bomber on a very specific map.

Formally, map is a checkered field of size 1 × n, the cells of which are numbered from 1 to n, in each cell there can be one or several tanks. Slava doesn't know the number of tanks and their positions, because he flies very high, but he can drop a bomb in any cell. All tanks in this cell will be damaged.

If a tank takes damage for the first time, it instantly moves to one of the neighboring cells (a tank in the cell n can only move to the cell n - 1, a tank in the cell 1 can only move to the cell 2). If a tank takes damage for the second time, it's counted as destroyed and never moves again. The tanks move only when they are damaged for the first time, they do not move by themselves.

Help Slava to destroy all tanks using as few bombs as possible.

Input

The first line contains a single integer n (2 ≤ n ≤ 100 000) — the size of the map.

Output

In the first line print m — the minimum number of bombs Slava needs to destroy all tanks.

In the second line print m integers k1, k2, ..., km. The number ki means that the i-th bomb should be dropped at the cell ki.

If there are multiple answers, you can print any of them.

Examples

input

2

output

3
2 1 2 

input

3

output

4
2 1 3 2 

题意：

 

有一行n列个格子，每个格子都存在一个或多个坦克，Slava会向格子内扔炸弹，当坦克第一次被炸时会随机向相邻的格子移动，第二次被炸将会损毁。问最少需要几次才能摧毁所有的坦克，并输出投入炸弹的顺序。

思路：

我们可以先对偶数位的格子投放炸弹，此时被炸的坦克一定会移向奇数位的格子，之后对奇数位的格子投放炸弹，之前移过来的坦克已损毁，但初始位于奇数位的坦克会移向偶数位的格子，我们再对偶数位的格子投放炸弹。这时所有坦克无论在哪都必定损毁。

示例程序：

 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,i;
    scanf("%d",&n);
    printf("%d\n2",n+n/2);
    for(i=4;n>=i;i=i+2)
    {
        printf(" %d",i);
    }
    for(i=1;n>=i;i=i+2)
    {
        printf(" %d",i);
    }
    for(i=2;n>=i;i=i+2)
    {
        printf(" %d",i);
    }
    return 0;
}