Chocolate Lunch

A convenience store near the school has started selling a new bar-shaped chocolate. Each bar is made of square pieces in a row, and the number of square pieces in a bar is always a power of two. Possible sizes are 1, 2, 4, 8, 16, ... pieces.

Sanggeun needs to eat at least K square pieces for lunch so that he can stay awake through the rest of his classes. His friend Seonyeong also likes chocolate, but she only eats chocolate that Sanggeun gives her.

Sanggeun will buy exactly one chocolate bar and split it as needed so that the pieces he eats contain exactly K squares in total. Any remaining pieces are given to Seonyeong. The K squares do not have to be in one contiguous piece; it is enough for the total number of squares across several pieces to be K.

A chocolate bar can only be split exactly in half. In other words, a bar with D square pieces splits into two bars with D/2 square pieces each.

Find the smallest chocolate size Sanggeun should buy and the minimum number of splits needed to make exactly K square pieces. Sanggeun can buy only one chocolate bar.

The first line contains an integer K. (1 ≤ K ≤ 1,000,000)

Print two integers separated by a space: the smallest chocolate size Sanggeun should buy, and the minimum number of splits required.