#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010;
int n, m, f[maxn];
int solve(int e) {
  int s = 0, k = 1;
  while (e > 1) {
    if ((e & 1) == 0) s |= k;
    k <<= 1;
    e >>= 1;
  }
  return s;
}
int main() {
  while (scanf("%d", &n) != EOF) {
    memset(f, -1, sizeof(f));
    long long ans = 0;
    for (int i = n; i >= 0; --i)
      if (f[i] == -1) {
        f[i] = solve(i);
        f[f[i]] = i;
      }
    printf("%I64d\n", (long long)(1 + n) * n);
    for (int i = 0; i <= n; ++i) printf("%d ", f[i]);
    printf("\n");
  }
  return 0;
}
