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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Hp
 */
public class CV171E {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] ans = new int [n + 1];
        int t = n;
        while (t > 0)
            t = put(t, ans);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        out.println((long) (n + 1) * n);
        for (int i = 0; i <= n; ++i)
            out.print(ans[i] + " ");
        out.close();
    }

    private static int put(int t, int[] ans) {
        int cur = Integer.highestOneBit(t);
        for (int i = 2 * cur - t - 1; i <= t; ++i)
            ans[i] = 2 * cur - 1 - i;
        return 2 * cur - t - 2;
    }
}
