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;
const int MAXN = 1000007;
int ans[MAXN];
void solve(int n) {
  if (n == 0) {
    ans[0] = 0;
  } else if (n == 1) {
    ans[0] = 1;
    ans[1] = 0;
  } else {
    int k = 1;
    while (k - 1 < n) {
      k *= 2;
    }
    k--;
    int cnt = -1;
    for (int i = 0; i <= n; i++) {
      if (k <= 0) {
        continue;
      }
      if (i + k <= n) {
        ans[i] = i + k;
        ans[i + k] = i;
      } else {
        cnt++;
      }
      k -= 2;
    }
    if (cnt != -1) solve(cnt);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  solve(n);
  long long sum = 0;
  for (int i = 0; i <= n; i++) {
    sum += ans[i] ^ i;
  }
  cout << sum << endl;
  for (int i = 0; i <= n; i++) {
    if (i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
  return 0;
}
