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 flag[2001100], ch[2001100];
int main() {
  memset(flag, 0, sizeof(flag));
  int n;
  scanf("%d", &n);
  int cnt = 0, tmp = n;
  while (tmp) {
    cnt++;
    tmp = tmp >> 1;
  }
  int tot = (1 << cnt) - 1;
  long long ans = 0;
  for (int i = n; i >= 0; i--) {
    int tmp = tot;
    int tt = tot - i;
    while (flag[tt] || tt > n) {
      tmp = tmp >> 1;
      if (tmp < i)
        break;
      else
        tt = tmp - i;
    }
    flag[tt] = 1;
    ch[i] = tt;
    ans += tmp;
  }
  printf("%I64d\n", ans);
  for (int i = 0; i <= n; i++)
    if (i == n)
      printf("%d\n", ch[i]);
    else
      printf("%d ", ch[i]);
  return 0;
}
