#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int ans[N], n;
long long sum = 0;
int getbits(int x) {
  int bits = 0;
  if (x == 0) return 1;
  while (x) bits++, x >>= 1;
  return bits;
}
int main() {
  cin >> n;
  memset(ans, -1, sizeof ans);
  for (int i = n; i; i--) {
    if (ans[i] != -1) continue;
    int x = i ^ ((1 << getbits(i)) - 1);
    ans[i] = x, ans[x] = i;
    sum += (x ^ i) << 1;
  }
  cout << sum << endl;
  for (int i = 0; i <= n; i++)
    printf("%d%c", ans[i] == -1 ? 0 : ans[i], i == n ? '\n' : ' ');
  return 0;
}
