#include <bits/stdc++.h>
using namespace std;
int n, x;
int a[1000047];
long long b;
int main() {
  scanf("%d", &n);
  int m = n + 1;
  while (n > 0) {
    int x = 1;
    while (x <= n) x *= 2;
    x--;
    int y = n;
    while (y > x - y) {
      a[y] = x - y;
      a[x - y] = y;
      y--;
    }
    n = x - n - 1;
  }
  b = 0;
  for (int i = 0; i < (m); ++i) b += a[i] ^ i;
  cout << b << endl;
  for (int i = 0; i < (m); ++i) cout << a[i] << endl;
}
