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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class E {
	static PrintWriter out;
	static StreamTokenizer st;
	static BufferedReader bf;

	public static void main(String[] args) throws IOException {
		bf = new BufferedReader(new InputStreamReader(System.in));
		st = new StreamTokenizer(bf);
		out = new PrintWriter(new OutputStreamWriter(System.out));
		int n = nextInt();
		long sum = 0;
		int[] p = new int[n + 1];
		Arrays.fill(p, -1);
		for (int i = n; i >= 0; i--) {
			if (p[i] == -1) {
				int x = i, pow = 0, cnt = 0;
				while (x > 0) {
					if (x % 2 == 0)
						cnt |= (1 << pow);
					x >>= 1;
					pow++;
				}
				p[i] = cnt;
				p[cnt] = i;
				sum += 2*(cnt^i);
			}
		}
		out.println(sum);
		for (int j = 0; j < p.length; j++) {
			out.print(p[j] + " ");
		}
		out.close();

	}

	private static String nextLine() throws IOException {
		return bf.readLine().trim();
	}

	private static double nextDouble() throws IOException {
		st.nextToken();
		return st.nval;
	}

	private static long nextLong() throws IOException {
		st.nextToken();
		return (long) st.nval;
	}

	private static int nextInt() throws IOException {
		st.nextToken();
		return (int) st.nval;
	}

}
