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 double PI = acos(-1);
const double EPS = 1e-7;
long long N;
long long duaPangkat[25];
long long ans[1000005];
long long leftMostBit(long long x) {
  long long ans = 0;
  while (x > 0) ans++, x /= 2LL;
  return ans;
}
int main() {
  scanf("%I64d", &N);
  memset(ans, -1, sizeof ans);
  for (long long i = N; i >= 0; i--) {
    if (ans[i] != -1) continue;
    ans[i] = i ^ ((1LL << (leftMostBit(i))) - 1);
    ans[i ^ ((1LL << (leftMostBit(i))) - 1)] = i;
  }
  printf("%I64d\n", N * (N + 1));
  for (long long i = 0; i <= N; i++) {
    printf("%I64d", ans[i]);
    if (i <= N - 1) printf(" ");
  }
  puts("");
  return 0;
}
