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 a[1000010];
long long dfs(int n) {
  int cnt = 0, tmp = n;
  while (tmp) {
    tmp >>= 1;
    cnt++;
  }
  cnt--;
  int x = (1 << cnt);
  int d = n - x;
  if (d == 0) {
    for (int i = n - 1; i >= 0; i--) a[i] = n - i - 1;
    return (long long)(n - 1) * (long long)n;
  }
  long long ret = 0;
  for (int i = n - 1; i >= n - d * 2; i--) {
    a[i] = x * 2 - 1 - i;
  }
  ret = (long long)d * (long long)2 * (long long)(x * 2 - 1);
  ret += dfs(n - d * 2);
  return ret;
}
int main(int argc, char* argv[]) {
  int n;
  scanf("%d", &n);
  cout << dfs(n + 1) << endl;
  for (int i = 0; i <= n; i++) printf("%d ", a[i]);
  printf("\n");
  return 0;
}
