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 d[1000010];
long long m[1000010];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cout << setprecision(10);
  long long n;
  cin >> n;
  for (long long i = n; i >= 0; i--) {
    if (m[i] == 1) continue;
    long long x = i;
    long long y = 0;
    long long p = 1;
    long long ans = 0;
    for (long long j = 0; j < 25; j++) {
      if (x % 2 == 0) {
        y += p;
        if (y <= n) {
          if (m[y] == 0) ans = y;
        }
      }
      x /= 2;
      p *= 2;
    }
    m[i] = 1;
    m[ans] = 1;
    d[i] = ans;
    d[ans] = i;
  }
  long long ans = 0;
  for (long long i = 0; i <= n; i++) {
    ans += (d[i] ^ i);
  }
  cout << ans << endl;
  for (long long i = 0; i <= n; i++) {
    cout << d[i] << " ";
  }
  cout << endl;
}
