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 long long MOD = 1e9 + 7;
const long long N = 1e6 + 5;
long long gcd(long long n, long long m) {
  if (n == 0)
    return m;
  else {
    return gcd(m % n, n);
  }
}
long long vis[N], ans[N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  for (long long i = n; i >= 0; i--) {
    if (!vis[i]) {
      long long sum = 0;
      long long flag = 0;
      for (long long j = 20; j >= 0; j--) {
        if (i & 1LL << j) {
          flag = 1;
        }
        if (flag == 1 && !(i & (1LL << j))) {
          sum += 1LL << j;
        }
      }
      ans[i] = sum;
      ans[sum] = i;
      vis[sum] = 1;
    }
  }
  long long ans1 = 0;
  for (long long i = 0; i <= n; i++) {
    ans1 += i ^ ans[i];
  }
  cout << ans1 << endl;
  for (long long i = 0; i <= n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
}
