Little penguin Polo likes permutations. But most of all he likes permutations of integers from 0 to n, inclusive.

For permutation p = p0, p1, ..., pn, Polo has defined its beauty — number <image>.

Expression <image> means applying the operation of bitwise excluding "OR" to numbers x and y. This operation exists in all modern programming languages, for example, in language C++ and Java it is represented as "^" and in Pascal — as "xor".

Help him find among all permutations of integers from 0 to n the permutation with the maximum beauty.

Input

The single line contains a positive integer n (1 ≤ n ≤ 106).

Output

In the first line print integer m the maximum possible beauty. In the second line print any permutation of integers from 0 to n with the beauty equal to m.

If there are several suitable permutations, you are allowed to print any of them.

Examples

Input

4


Output

20
0 2 1 4 3
#include <bits/stdc++.h>
using namespace std;
int ans[20], a[1100000];
int n;
int f(int x) {
  int k = 1;
  while (k < x) k *= 2;
  if (x == k)
    return x - 2;
  else
    return k / 2 - 2 - (x - k / 2);
}
void poisk(int x) {
  if (x == 0) {
    a[0] = 0;
    return;
  }
  int k = x + 1;
  k = k && x;
  if (k == 0) {
    for (int i = x; i >= 0; i--) ans[x - i] = i;
    return;
  }
  if (x == 2) {
    a[0] = 0;
    a[1] = 2;
    a[2] = 1;
    return;
  }
  k = f(x);
  poisk(k);
  for (int i = x; i > k; i--) {
    a[k + x - i + 1] = i;
  }
}
int main() {
  long long m = 0;
  cin >> n;
  poisk(n);
  for (int i = 0; i <= n; i++) m += i ^ a[i];
  cout << m << endl;
  for (int i = 0; i <= n; i++) {
    cout << a[i] << ' ';
  }
}
