#include <bits/stdc++.h>
using namespace std;
long long rdtsc() {
  long long tmp;
  asm("rdtsc" : "=A"(tmp));
  return tmp;
}
const int maxn = (int)1e6 + 1;
int a[maxn];
long long solve(int n) {
  if (n < 0) return 0;
  if (!n) {
    a[0] = 0;
    return 0;
  }
  int k = 0;
  for (; (1 << (k + 1)) <= n; k++)
    ;
  int it1, it2;
  long long ans = 0;
  for (it1 = (1 << k) - 1, it2 = (1 << k); it1 >= 0 && it2 <= n; it1--, it2++) {
    a[it1] = it2, a[it2] = it1;
    ans += 2 * (it1 ^ it2);
  }
  return ans + solve(it1);
}
int main() {
  srand(rdtsc());
  int n;
  while (scanf("%d", &n) >= 1) {
    printf(
        "%lld"
        "\n",
        solve(n));
    for (int i = 0; i <= n; i++) printf("%d%c", a[i], " \n"[i == n]);
  }
  return 0;
}
