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;
const int N = 1e6 + 9;
int a[N], n;
int cal(int x) {
  int i = 1;
  int ans = 0;
  while (x) {
    int t = -x & x;
    while (i < t) ans |= i, i <<= 1;
    i <<= 1;
    x -= t;
  }
  return ans;
}
int main() {
  cin >> n;
  memset(a, -1, sizeof(a));
  for (int i = n; i; i--)
    if (a[i] == -1) {
      int k = cal(i);
      if (~a[i]) {
        a[i] = i;
      } else {
        a[i] = k;
        a[k] = i;
      }
    }
  if (a[0] < 0) a[0] = 0;
  long long ret = 0;
  for (int i = 0; i <= n; i++) ret += a[i] | i;
  cout << ret << endl;
  for (int i = 0; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
