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;
int nnode, root, vis[1000005];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  while (cin >> n) {
    long long ans = 0;
    memset(vis, -1, sizeof vis);
    for (int i = n; i >= 0; i--) {
      int a = 0;
      int f = 0;
      if (vis[i] != -1) continue;
      for (int j = 26; j >= 0; j--) {
        f |= ((bool)(i & (1 << j)));
        if (f) {
          int b = ((bool)(i & (1 << j)));
          if (!b) a |= (1 << j);
        }
      }
      ans += 2 * (a ^ i);
      vis[a] = i;
      vis[i] = a;
    }
    cout << ans << endl;
    for (int i = 0; i <= n; i++) cout << vis[i] << " ";
    cout << endl;
  }
  return 0;
}
