Problem: An exam for n students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (i and i + 1) always studied side by side and became friends and if they take an exam sitting next to each other, they will help each other for sure.

Your task is to choose the maximum number of students and make such an arrangement of students in the room that no two students with adjacent numbers sit side by side.

Input

A single line contains integer n (1 ≤ n ≤ 5000) — the number of students at an exam.

Output

In the first line print integer k — the maximum number of students who can be seated so that no two students with adjacent numbers sit next to each other.

In the second line print k distinct integers a1, a2, ..., ak (1 ≤ ai ≤ n), where ai is the number of the student on the i-th position. The students on adjacent positions mustn't have adjacent numbers. Formally, the following should be true: |ai - ai + 1| ≠ 1 for all i from 1 to k - 1.

If there are several possible answers, output any of them.

Examples

Input

6

Output

6
1 5 3 6 2 4

Input

3


Output

2
1 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  if (n == 1 || n == 2) {
    cout << 1 << "\n" << 1;
    return 0;
  }
  if (n == 3) {
    cout << 2 << "\n" << 1 << " " << 3;
    return 0;
  }
  if (n == 4) {
    cout << 4 << "\n" << 2 << " " << 4 << " " << 1 << " " << 3;
    return 0;
  }
  if (n == 5) {
    cout << 5 << "\n"
         << "5 2 4 1 3";
    return 0;
  }
  if (n == 7) {
    cout << 7 << "\n"
         << "7 2 5 1 4 6 3";
    return 0;
  }
  int a[n + 1], b[n + 1], k = 0, c[n + 10], d[n + 1], h = 0;
  for (int i = 1; i <= n; i += 2) a[++k] = i;
  int l = 0;
  for (int i = 2; i <= n; i += 2) b[++l] = i;
  int m = 0, j = k;
  for (int i = 1; i <= k; i++) {
    m++;
    c[++h] = a[i];
    if (m == j) break;
    c[++h] = a[k--];
    m++;
    if (m == j) break;
  }
  m = 0, j = l;
  for (int i = 1; i <= l; i++) {
    c[++h] = b[l--];
    m++;
    if (m == j) break;
    c[++h] = b[i];
    m++;
    if (m == j) break;
  }
  k = 0;
  if (n % 2 == 1) {
    if (fabs(c[n / 2 + 1] - c[n / 2 + 2]) == 1) c[n / 2 + 1] = 0;
  } else {
    if (fabs(c[n / 2] - c[n / 2 + 1]) == 1) c[n / 2 + 1] = 0;
  }
  for (int i = 1; i <= h; i++) {
    if (c[i] != 0) {
      d[++k] = c[i];
    }
  }
  int f[n + 1], r = 0;
  d[++k] = 0;
  for (int i = 1; i <= k; i++) {
    if (fabs(d[i] - d[i + 1]) != 1 && d[i] != 0) {
      f[++r] = d[i];
    }
  }
  cout << r << "\n";
  for (int i = 1; i <= r; i++) {
    cout << f[i] << " ";
  }
}