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 unsigned long long maxn = 1000000 + 10;
unsigned long long bit[25];
unsigned long long ans[maxn];
unsigned long long visA[maxn], visB[maxn];
int main() {
  unsigned long long n;
  cin >> n;
  unsigned long long len = -1;
  for (unsigned long long i = 0; i <= 20; i++) {
    bit[i] = (1 << i) - 1;
    if (n > bit[i]) len = i + 1;
  }
  unsigned long long maxsum = 0ULL;
  for (unsigned long long i = len; i >= 1; i--) {
    for (unsigned long long j = 0; j <= n; j++) {
      if (visA[j] == 1) continue;
      unsigned long long t = ~j;
      t = t & bit[i];
      if (t <= n && visB[t] == 0) {
        ans[j] = t;
        visB[t] = 1;
        visA[j] = 1;
      }
    }
  }
  for (unsigned long long i = 0; i <= n; i++) maxsum += (i ^ ans[i]);
  cout << maxsum << endl;
  for (unsigned long long i = 0; i < n; i++) cout << ans[i] << " ";
  cout << ans[n] << endl;
  return 0;
}
