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.Scanner;

// http://codeforces.com/contest/289/problem/E
public class PolothePenguinandXORoperation {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        s.close();
        int[] p = new int[n + 1];
        for (int b = 24, nn = n; b >= 0 && nn >= 0; b--) {
            int bb = 1 << b;
            if ((bb & nn) != 0) {
                int cnt = nn + 1 - bb;
                for (int j = 0; j < cnt; j++) {
                    p[nn - j] = nn - cnt - cnt + 1 + j;
                    p[nn - cnt - cnt + 1 + j] = nn - j;
                }
                nn = nn - cnt - cnt;
            }
        }
        long count = 0;
        for (int i = 0; i <= n; i++) {
            count += p[i] ^ i;
        }
        System.out.println(count);
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i <= n; i++) {
            sb.append(p[i]);
            sb.append(' ');
        }
        System.out.println(sb);
    }
}
