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 arr[1000005];
bool visi[1000005];
int main() {
  int i, j, tst, cas = 1, n;
  int a, cnt = 0;
  scanf("%d", &n);
  a = n;
  while (a) {
    cnt++;
    a >>= 1;
  }
  long long ans = 0;
  while (cnt >= 0) {
    long long pres = 1 << cnt;
    pres--;
    for (i = n; i >= 0; i--) {
      if (visi[i]) {
        continue;
      }
      int now = pres ^ i;
      if (now > n) {
        continue;
      }
      if (visi[now]) {
        continue;
      } else {
        visi[now] = 1;
        visi[i] = 1;
        arr[now] = i;
        arr[i] = now;
        ans += pres * 2;
      }
    }
    cnt--;
  }
  cout << ans << endl << arr[0];
  for (i = 1; i <= n; i++) {
    printf(" %d", arr[i]);
  }
  putchar(10);
  return 0;
}
