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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Trung Pham
 */
public class E {

    public static void main(String[] args) {
        Scanner in = new Scanner(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        int n = in.nextInt();
        int[] data = new int[n + 1];
        Arrays.fill(data, -1);
        long result = 0;
        for (int i = n; i >= 0; i--) {
            if (data[i] != -1) {
                continue;
            }
            int start = 1;
            while (start <= i) {
                start = start << 1;
            }
            int temp = i ^ (start - 1);
           // System.out.println(start + " " + i + " " + temp);
            if (temp <= n && data[temp] == - 1) {
                data[i] = temp;
                data[temp] = i;
                result += i ^temp;
            }
        }
        out.println(2*result);
        for(int i = 0; i < data.length; i++){
            out.print(data[i] + " ");
        }
        out.close();
    }
}
