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 maxn = 1000010;
int n, m, f[maxn];
int solve(int e) {
  int s = 0, k = 1;
  while (e > 1) {
    if ((e & 1) == 0) s |= k;
    k <<= 1;
    e >>= 1;
  }
  return s;
}
int main() {
  while (scanf("%d", &n) != EOF) {
    memset(f, -1, sizeof(f));
    long long ans = 0;
    for (int i = n; i >= 0; --i)
      if (f[i] == -1) {
        f[i] = solve(i);
        f[f[i]] = i;
      }
    printf("%I64d\n", (long long)(1 + n) * n);
    for (int i = 0; i <= n; ++i) printf("%d ", f[i]);
    printf("\n");
  }
  return 0;
}
