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 = 1001000;
int N, Ans[NMax];
int wei(int a) {
  int k = 0;
  while (a > 0) k++, a /= 2;
  return k;
}
int main() {
  memset(Ans, -1, sizeof(Ans));
  scanf("%d", &N);
  long long ret = 0;
  for (int i = N; i > 0; i--)
    if (Ans[i] == -1) {
      int x = ((~i) & ((1 << wei(i)) - 1));
      Ans[i] = x;
      Ans[x] = i;
    }
  if (Ans[0] == -1) Ans[0] = 0;
  for (int i = 0; i <= N; i++) ret += ((long long)Ans[i] ^ (long long)i);
  printf("%I64d\n", ret);
  for (int i = 0; i < N; i++) printf("%d ", Ans[i]);
  printf("%d\n", Ans[N]);
  getchar();
  getchar();
  return 0;
}
