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

public class C {
    public static void main(String[] args) throws Exception {
        new C().solve();
    }

    void solve() throws IOException {
        BufferedReader in = new BufferedReader(new
                InputStreamReader(System.in));
        String[] sp;
        Scanner sc = new Scanner(System.in);

        int K = sc.nextInt();
        int[] p = new int[K + 1];
        Arrays.fill(p, -1);

        for (int kk = K; kk >= 1; kk--) {
            if (p[kk] == -1) {
                int h = Integer.highestOneBit(kk);
                int kk2 = h * 2 - 1 ^ kk;
                p[kk] = kk2;
                p[kk2] = kk;
            }
        }
        if (p[0] == -1) {
            p[0] = 0;
        }

        long ret = 0;
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i <= K; i++) {
            ret += i ^ p[i];
            sb.append(p[i]);
            if (i != K) {
                sb.append(" ");
            }
        }
        System.out.println(ret);
        System.out.print(sb);
    }
}

//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
