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;
long long mx = 0;
int ans[1000006];
int cr(int j) {
  int a[23];
  int i = 0;
  while (j > 0) {
    a[i++] = j % 2;
    j >>= 1;
  }
  for (int k = 0; k < i; k++) a[k] = !a[k];
  int res = 0;
  for (int k = i - 1; k >= 0; k--) res = 2 * res + a[k];
  return res;
}
int main() {
  int n;
  cin >> n;
  for (int i = n; i >= 0; i--) {
    if (!ans[i]) {
      int j = cr(i);
      ans[i] = j;
      ans[j] = i;
    }
    mx += ((i * 1LL) ^ (1LL * ans[i]));
  }
  cout << mx << endl;
  for (int i = 0; i <= n; i++) {
    cout << ans[i] << " ";
  }
}
