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;
int mark[2000010], ret[2000010];
int n;
int main() {
  int i, j, k;
  while (scanf("%d", &n) != EOF) {
    int cnt = 0;
    k = n;
    while (k) {
      cnt++;
      k /= 2;
    }
    int nm = 1 << cnt;
    nm--;
    for (i = 0; i <= nm; i++) {
      mark[i] = 0;
    }
    long long res = 0;
    for (i = n; i >= 0; i--) {
      int tmp = nm ^ i;
      k = tmp;
      while ((tmp > n || mark[tmp])) {
        tmp = (tmp - 1) & k;
      }
      mark[tmp] = 1;
      res += tmp ^ i;
      ret[i] = tmp;
    }
    cout << res << endl;
    printf("%d", ret[0]);
    for (i = 1; i <= n; i++) {
      printf(" %d", ret[i]);
    }
    printf("\n");
  }
  return 0;
}
