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;
void JIZZ() {
  cout << "";
  exit(0);
}
const long double PI = 3.14159265358979323846264338327950288;
const long double eps = 1e-13;
const long long mod = 1e9 + 7;
bitset<1000006> v;
int op[1000006];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long ans = 0;
  int n;
  cin >> n;
  for (int i = n; i >= 0; --i) {
    if (v[i]) continue;
    int mat = i;
    for (int j = 0;; ++j) {
      if ((1 << (j)) > mat) break;
      mat ^= (1 << j);
    }
    ans += i ^ mat;
    v[mat] = 1;
    op[i] = mat;
    op[mat] = i;
    ;
    ;
  }
  cout << ans * 2 << endl;
  for (int i = 0; i <= n; ++i) cout << op[i] << " ";
}
