Problem: Cat Furrier Transform is a popular algorithm among cat programmers to create longcats. As one of the greatest cat programmers ever exist, Neko wants to utilize this algorithm to create the perfect longcat.

Assume that we have a cat with a number x. A perfect longcat is a cat with a number equal 2^m - 1 for some non-negative integer m. For example, the numbers 0, 1, 3, 7, 15 and so on are suitable for the perfect longcats.

In the Cat Furrier Transform, the following operations can be performed on x:

  * (Operation A): you select any non-negative integer n and replace x with x ⊕ (2^n - 1), with ⊕ being a [bitwise XOR operator](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
  * (Operation B): replace x with x + 1. 



The first applied operation must be of type A, the second of type B, the third of type A again, and so on. Formally, if we number operations from one in the order they are executed, then odd-numbered operations must be of type A and the even-numbered operations must be of type B.

Neko wants to produce perfect longcats at industrial scale, thus for each cat Neko only wants to perform at most 40 operations. Can you help Neko writing a transformation plan?

Note that it is not required to minimize the number of operations. You just need to use no more than 40 operations.

Input

The only line contains a single integer x (1 ≤ x ≤ 10^6).

Output

The first line should contain a single integer t (0 ≤ t ≤ 40) — the number of operations to apply.

Then for each odd-numbered operation print the corresponding number n_i in it. That is, print ⌈ t/2 ⌉ integers n_i (0 ≤ n_i ≤ 30), denoting the replacement x with x ⊕ (2^{n_i} - 1) in the corresponding step.

If there are multiple possible answers, you can print any of them. It is possible to show, that there is at least one answer in the constraints of this problem.

Examples

Input


39


Output


4
5 3 

Input


1


Output


0


Input


7


Output


0

Note

In the first test, one of the transforms might be as follows: 39 → 56 → 57 → 62 → 63. Or more precisely:

  1. Pick n = 5. x is transformed into 39 ⊕ 31, or 56. 
  2. Increase x by 1, changing its value to 57. 
  3. Pick n = 3. x is transformed into 57 ⊕ 7, or 62. 
  4. Increase x by 1, changing its value to 63 = 2^6 - 1. 



In the second and third test, the number already satisfies the goal requirement.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
int a[10];
int i;
int convert(int n) {
  for (i = 0; n > 0; i++) {
    a[i] = n % 2;
    n = n / 2;
  }
  return i;
}
int main() {
  int x, j, flag = 0, count = 0, sum = 0, temp, nol = 0, noo = 0, k = 0;
  scanf("%d", &x);
  int arr[40];
  convert(x);
  while (k < 40) {
    if ((pow(2, i) - 1) == x || (pow(2, i + 1) - 1) == x) {
      printf("0");
      return 0;
    }
    flag = 0;
    count = 0;
    sum = 0;
    for (j = 0; j < i; j++) {
      if ((a[j] == 0 && a[j + 1] == 1) && flag != 1) {
        a[j] = 1 - a[j];
        flag = 1;
      } else if (!(a[j] == 0 && a[j + 1] == 1) && flag != 1) {
        a[j] = 1 - a[j];
        count++;
      }
      sum += (pow(2, j)) * a[j];
    }
    noo++;
    arr[k] = count + 1;
    k++;
    if ((pow(2, i) - 1) == sum || (pow(2, i + 1) - 1) == sum) {
      printf("%d\n", noo);
      break;
    } else if ((pow(2, i) - 1) == sum + 1 || (pow(2, i + 1) - 1) == sum + 1) {
      noo++;
      printf("%d\n", noo);
      break;
    } else
      convert(sum + 1);
    noo++;
  }
  for (i = 0; i < k; i++) printf("%d ", arr[i]);
}