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 match[1000006] = {0};
long long pow2[23];
void table() {
  int cnt = 0;
  for (long long i = 2; i <= 2000000; i = i * 2) {
    pow2[cnt++] = i;
  }
}
int findmatch(int m) {
  int k = upper_bound(pow2, pow2 + 20, m) - pow2;
  return pow2[k] - 1 - m;
}
int main() {
  long long n;
  cin >> n;
  long long maxnum = n;
  long long leftnum = n + 1;
  table();
  while (leftnum > 1) {
    int minnum = findmatch(maxnum);
    for (int i = minnum; i <= maxnum; i++) {
      match[i] = maxnum + minnum - i;
    }
    leftnum = leftnum - (maxnum - minnum + 1);
    maxnum = minnum - 1;
  }
  long long sum = (1 + n) * n;
  cout << sum << endl;
  for (int i = 0; i < n; i++) {
    cout << match[i] << " ";
  }
  cout << match[n] << endl;
}
