#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
int res[1000005], n;
void rec(int k) {
  if (k < 0) return;
  if (k == 0) {
    res[0] = 0;
    return;
  }
  int meja = 1;
  while (meja * 2 <= k) meja *= 2;
  int raz = k - meja;
  for (int i = k; i >= meja - raz - 1; i--) {
    int mim = abs(i - meja);
    if (i >= meja) {
      res[i] = meja - mim - 1;
    } else {
      res[i] = meja + mim - 1;
    }
  }
  rec(meja - raz - 2);
}
int main() {
  scanf("%d", &n);
  long long vsota = (long long)n * (long long)(n + 1);
  cout << vsota << "\n";
  rec(n);
  for (int i = 0; (i) < (n); (i)++) printf("%d ", res[i]);
  printf("%d", res[n]);
  return 0;
}
