#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 1e6 + 5;
long long gcd(long long n, long long m) {
  if (n == 0)
    return m;
  else {
    return gcd(m % n, n);
  }
}
long long vis[N], ans[N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  for (long long i = n; i >= 0; i--) {
    if (!vis[i]) {
      long long sum = 0;
      long long flag = 0;
      for (long long j = 20; j >= 0; j--) {
        if (i & 1LL << j) {
          flag = 1;
        }
        if (flag == 1 && !(i & (1LL << j))) {
          sum += 1LL << j;
        }
      }
      ans[i] = sum;
      ans[sum] = i;
      vis[sum] = 1;
    }
  }
  long long ans1 = 0;
  for (long long i = 0; i <= n; i++) {
    ans1 += i ^ ans[i];
  }
  cout << ans1 << endl;
  for (long long i = 0; i <= n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
}
