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
//package topcoders;

import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class c2apr5 {

    /**
     * @param args
     */
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] ans = new int[n + 1];
        long sum = 0;

        Arrays.fill(ans, -1);
        for (int i = n; i >= 0; i--) {

            if (ans[i] == -1) {
                int t = 0;
                t = findLowerComplement(i);

                sum += (long)(2 * (i ^ t));
                ans[i] = t;
                ans[t] = i;
            }

        }

        
        
        PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

        pw.println(sum);
        for (int i = 0; i <= n; i++) {
            pw.print(ans[i] + " ");
        }
        
        pw.close();

    }

    private static int findLowerComplement(int x) {

        int compl = 0, k = 0;

        while (x > 0) {
            if ((x & 1) == 0) {
                compl |= (1 << k);
            }

            x >>= 1;
            k++;
        }

        return compl;
    }

}
