Everyone knows that 01 bits have magical power, today MatRush want to dig out, if the length of a 01 bit sequence is n, how many distinct subsequences in all the distinct n-length sequences? And what's the maximal number of different subsequences of one n-length 01 sequence? Because this problem is too hard, you need only calculate the answers from n=1 to n=17.
17 lines in total, for each line, output the n, answer1 and answer2.
1 2 1
2 6 3
3 14 5
..14 lines left for you!..
if n = 2, there is 6 distinct subsequences: [0, 00, 1, 10, 11, 01]. And the 10 or 01 sequence
have the maximal number of different subsequences. [0, 1, 10] or [0, 1, 01].
