#include <bits/stdc++.h>
int n;
int a[1000006];
int b[1000];
long long ans = 0;
bool found[1000006];
int main() {
  scanf("%d", &n);
  for (int i = n; i >= 1; i--) {
    if (found[i]) {
      continue;
    }
    int x = i, bit = 0;
    while (x > 0) {
      b[bit++] = x & 1;
      x >>= 1;
    }
    bit--;
    int sum = 0;
    for (int j = 0; j <= bit; j++) {
      sum += b[j] ? 0 : (1 << j);
    }
    a[sum] = i;
    a[i] = sum;
    found[i] = found[sum] = true;
    ans += (sum ^ i) * 2;
  }
  printf("%I64d\n", ans);
  for (int i = 0; i <= n; i++) {
    printf("%d ", a[i]);
  }
  printf("\n");
}
