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 CA(int x) {
  int i = 0;
  int aux = x;
  while (aux > 0) {
    aux >>= 1;
    i++;
  }
  return (x ^ ((1 << (i)) - 1));
}
int main() {
  int n;
  cin >> n;
  int vis[n + 1];
  memset(vis, 0, sizeof(vis));
  int p[n + 1];
  long long int k = 0;
  for (int i = n; i >= 0; i--) {
    if (vis[i] == 0) {
      vis[i] = 1;
      p[i] = CA(i);
      vis[p[i]] = 1;
      p[p[i]] = i;
      k += i ^ p[i];
    }
  }
  cout << 2 * k << endl;
  for (int i = 0; i <= n; i++) cout << p[i] << " ";
  return 0;
}
