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;
bool vst[1000006];
int Ans[1000006];
int main() {
  int n;
  long long ans = 0;
  int t = 1, i, j, c = 0;
  cin >> n;
  while (t < n) {
    t <<= 1;
    c++;
  }
  bool f = 0;
  if (t == n) {
    f = 1;
    Ans[0] = n;
  }
  for (i = n; i >= 0; i--) {
    if (f && !i) break;
    while (true) {
      t = (1 << c);
      t = t - 1;
      j = (~i & t);
      if (j <= n && !vst[j]) {
        break;
      }
      c--;
    }
    Ans[i] = j;
    vst[j] = true;
  }
  for (i = (0); i <= (n); i++) {
    ans += Ans[i] ^ i;
  }
  cout << ans << endl;
  for (i = (0); i <= (n); i++) cout << Ans[i] << " ";
  return 0;
}
