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 NMAX = 1000010;
int N, P[NMAX];
void Solve(int N) {
  if (N <= 0) return;
  int Bit;
  for (int i = 0; i < 20; ++i)
    if (N & (1 << i)) Bit = i;
  for (int i = 0; i <= N; ++i)
    if (i & (1 << Bit)) {
      int Left = i - 1, Right = i;
      while (Left >= 0 && Right <= N)
        P[Left] = Right, P[Right] = Left, Left--, Right++;
      Solve(Left);
      break;
    }
}
int main() {
  scanf("%i", &N);
  Solve(N);
  long long Ans = 0;
  for (int i = 0; i <= N; ++i) Ans += 1LL * (i ^ P[i]);
  printf("%I64d\n", Ans);
  for (int i = 0; i <= N; ++i) printf("%i ", P[i]);
}
