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;


public class Main 
{
    int n;
    int ans[] = new int[1111111];
    
    public int highest(int x)
    {
        int i;
        for (i=1; i<=x; i<<=1)
            ;
        return i;
    }
    public Main()
    {
        Scanner cin = new Scanner(System.in);
        n = cin.nextInt();
        long cnt = 0;
        
        for (int i=0; i<=n; i++)
            ans[i] = -1;
        
        
        for (int i=n; i>=1; i--)
        {
            if (ans[i] != -1) continue;
            
            int j = (highest(i) - 1) ^ i;
            
            if (ans[j] == -1)
            {
                ans[i] = j; 
                ans[j] = i;
                cnt += 2 * (highest(i) - 1);
            }
        }
            
        System.out.println(cnt);
        if (ans[0] == -1) ans[0] = 0;
        for (int i=0; i<=n; i++)
            System.out.print(ans[i] + " ");
    }
    public static void main(String[] args) 
    {
        new Main();
    }

}
