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
n = int(raw_input());
r = [-1 for i in range(n + 1)];

p = [];

tmp = 1;
for i in range(100):
    tmp = tmp << 1;
    p.append(tmp -1);
    if tmp - 1 > 1000000:
        break;


def find_Firt_Big(x):
    l = 0;
    r = len(p) - 1;
    res = p[0];
    while l < r:
        mid = (l + r) / 2;
        if p[mid] >= x:
            r = mid;
        else:
            l = mid + 1;
            res = p[l];
    return res;
    

total = 0;
for i in range(n + 1):
    a = n - i;
    if r[a] == -1:
        tmp = find_Firt_Big(a);
        b = a ^ tmp;
        if r[b] == -1:
            r[a] = b;
            r[b] = a;
            total += tmp * 2;
        else:
            r[a] = a;
print total;
print ' '.join(map(str, r));


    