Little penguin Polo likes permutations. But most of all he likes permutations of integers from 0 to n, inclusive.

For permutation p = p0, p1, ..., pn, Polo has defined its beauty — number <image>.

Expression <image> means applying the operation of bitwise excluding "OR" to numbers x and y. This operation exists in all modern programming languages, for example, in language C++ and Java it is represented as "^" and in Pascal — as "xor".

Help him find among all permutations of integers from 0 to n the permutation with the maximum beauty.

Input

The single line contains a positive integer n (1 ≤ n ≤ 106).

Output

In the first line print integer m the maximum possible beauty. In the second line print any permutation of integers from 0 to n with the beauty equal to m.

If there are several suitable permutations, you are allowed to print any of them.

Examples

Input

4


Output

20
0 2 1 4 3
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline string tostring(const T &x) {
  ostringstream os;
  os << x;
  return os.str();
}
inline int toint(const string &s) {
  istringstream is(s);
  int x;
  is >> x;
  return x;
}
inline int todecimal(string s) {
  int a = 0;
  for (int i = 0; i < s.size(); i++) a = 2 * a + (s[i] - '0');
  return a;
}
inline string tobinary(int a) {
  string s;
  while (a != 0) {
    s = (char)(a % 2 + '0') + s;
    a >>= 1;
  }
  return s;
}
template <typename T>
inline T sqr(T x) {
  return x * x;
}
template <typename T>
T gcd(T a, T b) {
  return (b == 0) ? abs(a) : gcd(b, a % b);
}
inline int isvowel(char c) {
  if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') return 1;
  return 0;
}
inline int isprime(int a) {
  for (int i = 2; i * i <= a; i++)
    if (!(a % i)) return 0;
  return 1;
}
inline void inp(int &n) {
  n = 0;
  int ch = getchar();
  int sign = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    n = (n << 3) + (n << 1) + ch - '0', ch = getchar();
  n = n * sign;
}
const int dx4[4] = {0, 0, 1, -1};
const int dy4[4] = {1, -1, 0, 0};
const int dx8[8] = {0, 0, 1, 1, 1, -1, -1, -1};
const int dy8[8] = {1, -1, 0, 1, -1, 1, 0, -1};
class node {
 public:
  int x, y, z;
  node(int a, int b, int c) {
    x = a;
    y = b;
    z = c;
  }
};
bool operator<(const node &a, const node &b) { return a.x > b.x; }
bool compare(const node &a, const node &b) { return a.x < b.x; }
int n;
const int maxn = (int)1e6 + 5;
int a[maxn];
void solve() {
  int mask = 1;
  while (mask <= n) {
    mask <<= 1;
  }
  mask -= 1;
  memset(a, 0, sizeof a);
  for (int i = n; i >= 0; i--) {
    if (!a[i]) {
      while ((i ^ mask) > i) mask >>= 1;
      a[i] = (i ^ mask);
      a[(i ^ mask)] = i;
    }
  }
  long long sum = 0;
  for (int i = 0; i <= n; i++) sum += a[i] ^ i;
  cout << sum << endl;
  for (int i = 0; i <= n; i++) {
    if (i) cout << " ";
    cout << a[i];
  }
  cout << endl;
}
void input() { cin >> n; }
int main() {
  int testcase = 1;
  for (int i = 0; i < testcase; i++) {
    input();
    solve();
  }
  return 0;
}
