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


public class MainClass {
	
	public static void main(String[] args) { 
		Locale.setDefault(Locale.US);
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		MainClass solution = new MainClass();
		solution.run(in, out);
		in.close();
		out.close();
	}
	
	public void run(Scanner in, PrintWriter out) {
		int n = in.nextInt();
		long ans = 0;
		int[] perm = new int[n + 1];
		boolean[] used = new boolean[n + 1];
		for (int i = n; i >= 0; i--) {
			if (!used[i]){ 
				used[i] = true;
				int j = 1;
				while (j <= i)
					j <<= 1;
				j = i ^ (j - 1);
				used[j] = true;
				perm[i] = j;
				perm[j] = i;
			}
			ans += (long) i ^ perm[i];
		}
		out.println(ans);
		for (int i = 0; i <= n; i++)
			out.print(perm[i] + " ");
	}
	
}
