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;
long long fn(long long a) {
  long long k = 0;
  long long ret = 0;
  while (a > 0) {
    if ((a & 1) == 0) {
      ret = ret | (1 << k);
    }
    k++;
    a = a >> 1;
  }
  return ret;
}
long long ans[1000060];
int main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  for (long long i = n; i >= 0; i--) {
    if (!ans[i]) {
      long long aw = fn(i);
      ans[i] = aw;
      ans[aw] = i;
    }
  }
  long long m = 0;
  for (long long i = n; i >= 0; i--) {
    m += ans[i] ^ i;
  }
  cout << m << endl;
  for (long long i = 0; i <= n; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
