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
import java.io.PrintWriter;
import java.util.Scanner;

public class main
{

 /**
  * @param args
  */
 public static int reverse(int x)
 {
  int k = 0;
  int r = 0;
  while (x > 0)
  {
   if (x % 2 == 0)
   {
    r = r + (1 << k);
   }
   x = x / 2;
   k = k + 1;
  }
  return r;
 }

 public static void main(String[] args)
 {
  Scanner s = new Scanner(System.in);
  PrintWriter out = new PrintWriter(System.out);
  int n = s.nextInt();
  int[] r = new int[n + 1];
  long c = 0;
  for (int i = n; i >= 0; i--)
  {
   r[i] = -1;
  }

  for (int i = n; i >= 0; i--)
  {
   if (r[i] == -1)
   {
    int rev = reverse(i);
    r[i] = rev;
    r[rev] = i;
    c += (rev ^ i) << 1;
   }
  }
  out.println(c);
  for (int i = 0; i <= n; i++)
  {
   out.print(r[i]);
   out.print(" ");
  }
  out.flush();
 }
}