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 E {

    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] memo = new int[n + 1];
        boolean[] ch = new boolean[n + 1];
        for (int i = n; i > 0; i--) {
            if (ch[i])
                continue;
            long k = (long) (Math.log10(i) / Math.log10(2)) + 1;
            k = (long) Math.pow(2, k) - 1;
            k = k ^ i;
            ch[(int) k] = true;
            memo[(int) i] = (int) k;
            memo[(int) k] = (int) i;
        }
        long ans=0;
        for(int i=0;i<=n;i++){
            ans+=(memo[i]^i);
        }
        out.println(ans);
        out.print(memo[0]);
        for (int i = 1; i <= n; i++) {
            out.print(" " + memo[i]);
        }
        out.println();
        out.close();
    }

}
