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.util.*;
import java.math.*;
import java.io.*;

public class CF289E {
	static int[] perm;
	static int n;
	static Set<Integer> set;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		n = scan.nextInt();
		perm = new int[n + 1];
		set = new HashSet<>();
		for(int i = 0 ; i <= n ; i++)
			set.add(i);
		for(int i = n ; i >= 0 ; i--) {
			int goal = ~i;
			perm[i] = bestCase(goal);
		}
		out.println(beauty());
		for(int i = 0 ; i <= n ; i++)
			out.print(perm[i] + " ");
		out.close();
	}
	static int bestCase(int goal) {
		for(int i = 31 ; i >= 0 ; i--) {
			int bit = 1 << i;
			if(set.contains(goal)) {
				set.remove(goal);
				return goal;
			}
			if((goal & bit) != 0) // does bit exist?
				goal ^= bit; // erase bit
		}
		return goal;
	}
	static long beauty() {
		long res = 0;
		for(int i = 0 ; i <= n ; i++)
			res += perm[i] ^ i;
		return res;
	}
}
