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 inf = 2000000000;
const int maxn = 1000005;
int n;
int a[maxn];
bool vis[maxn];
int main() {
  long long ans = 0LL;
  scanf("%d", &n);
  for (int i = n; i >= 0; i--) {
    if (vis[i]) continue;
    int t = 0, s = 0;
    for (int j = 0; j < 20; j++)
      if (i & (1 << j)) s = j;
    for (int j = s - 1; j >= 0; j--)
      if (!(i & (1 << j))) t |= (1 << j);
    a[i] = t, a[t] = i;
    vis[i] = vis[t] = 1;
    ans += 2 * (i ^ t);
  }
  printf("%I64d\n", ans);
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
  printf("%d\n", a[n]);
  return 0;
}
