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 = 1e6 + 5;
const long long INF = 1e18 + 4;
const long double eps = 1e-9;
const long double pi = 3.1415926535897932384626433832795;
int ans[maxn];
long long m;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(20);
  int n;
  cin >> n;
  for (int i = 0; i <= n; i++) ans[i] = -1;
  for (int i = n; i >= 0; i--) {
    if (ans[i] == -1) {
      int num = i, p = 1, x = 0;
      while (num) {
        int dig = num % 2;
        x += p * (dig ^ 1);
        p *= 2;
        num /= 2;
      }
      ans[i] = x;
      ans[x] = i;
    }
    m += (long long)ans[i] ^ i;
  }
  cout << m << endl;
  for (int i = 0; i <= n; i++) cout << ans[i] << " ";
  return 0;
}
