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 = 2000000;
int i, n, j, f[Maxn], vis[Maxn], len, cs;
char s[Maxn];
int work(int num) {
  int ans = 0, p = 1;
  while (num) {
    if (num & 1)
      ans += 0;
    else
      ans += p;
    p *= 2;
    num /= 2;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  long long ans = 0;
  for (i = n; i >= 0; i--)
    if (!vis[i]) {
      int p = work(i);
      ans += 2 * (p ^ i);
      vis[p] = i;
      vis[i] = p;
    }
  cout << ans << endl;
  for (i = 0; i <= n; i++) cout << vis[i] << ' ';
}
