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 taken[1000003];
int ans[1000003];
int main() {
  {
    int N;
    cin >> N;
    memset(taken, false, sizeof taken);
    unsigned long long sum = 0;
    for (int n = N; n >= 0; n--) {
      if (taken[n]) continue;
      int M = 0;
      for (int nrbits = 0; (1 << nrbits) <= n; M += (1 << nrbits), nrbits++)
        ;
      int pair = M ^ n;
      if (pair <= N && !taken[pair]) {
        taken[n] = true;
        taken[pair] = true;
        ans[n] = pair;
        ans[pair] = n;
        sum += 2 * (pair ^ n);
        continue;
      }
    }
    cout << sum << endl;
    cout << ans[0];
    for (int i = (1); i < (N + 1); i++) cout << ' ' << ans[i];
    cout << endl;
  }
  return 0;
}
