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 getlen(int x) {
  int num = 0;
  while (x) {
    num++;
    x /= 2;
  }
  return num;
}
int vis[1000010];
long long ans = 0;
int main() {
  int n;
  scanf("%d", &n);
  int len = getlen(n), i;
  int limit = (1 << len) - 1;
  memset(vis, 0, sizeof(vis));
  for (i = n; i >= 0; i--) {
    if (vis[i]) continue;
    int t = limit - i;
    for (int j = len; j >= 1; j--) {
      if (t <= n && !vis[t]) {
        ans += (t ^ i);
        vis[i] = t;
        vis[t] = i;
        if (t != i) ans += (t ^ i);
        break;
      }
      if ((1 << (j - 1)) & t) {
        t -= (1 << (j - 1));
      }
    }
  }
  printf("%I64d\n", ans);
  for (i = 0; i <= n; i++) printf("%d ", vis[i]);
  printf("\n");
  return 0;
}
