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;
int a[1000010];
void debug(int i, int n) {
  for (int s = n - 1; s >= 0; s--) {
    char c = ((i & (1 << s)) ? '1' : '0');
    printf("%c", c);
  }
  cout << endl;
}
int main() {
  istream& in = cin;
  int N;
  in >> N;
  long long ans = (long long)N * (N + 1);
  for (int i = N; i >= 0;) {
    int p = 1;
    int t = i;
    while (t) {
      t >>= 1;
      p <<= 1;
    }
    p -= 1;
    int j = p ^ i;
    int nextI = j - 1;
    for (; j < i; j++, i--) {
      a[i] = j;
      a[j] = i;
    }
    i = nextI;
  }
  printf("%I64d\n", ans);
  for (int i = 0; i <= N; i++) {
    printf("%d ", a[i]);
  }
}
