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 MOD = 1e9 + 7;
long long f(int x) {
  if (x == 0) return 0;
  int y = 1;
  while (x > 1) {
    y++;
    x /= 2;
  }
  while (y--) x *= 2;
  return x - 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  long long a[n + 1];
  for (int i = 0; i <= n; ++i) {
    a[i] = -1;
  }
  long long ans = 0;
  for (int i = n; i >= 0; --i) {
    if (a[i] == -1) {
      long long x = f(i);
      a[x - i] = i;
      a[i] = x - i;
      ans += 2 * (x);
    }
  }
  cout << ans << endl;
  for (int i = 0; i < n + 1; ++i) {
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
