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;
bool vis[1000005];
long long getInver(int x) {
  long long po = 1, ct = 0;
  ;
  while (po * 2 <= x) po *= 2, ct++;
  long long ans = 0;
  for (int i = 0; i < ct; i++)
    if (!(x >> i & 1)) ans += (1 << i);
  return ans;
}
int p[1000005];
int main() {
  int n;
  while (cin >> n) {
    memset(vis, 0, sizeof vis);
    memset(p, -1, sizeof p);
    for (int i = n; i >= 0; i--) {
      if (vis[i]) continue;
      long long x = getInver(i);
      p[i] = x;
      p[x] = i;
      vis[i] = vis[x] = 1;
    }
    long long ans = 0;
    for (long long i = 0; i <= n; i++) ans += (p[i] ^ i);
    cout << ans << endl;
    for (int i = 0; i <= n; i++) {
      if (i == 0)
        printf("%d", p[i]);
      else
        printf(" %d", p[i]);
    }
    puts("");
  }
}
