Write a C code:

You have a deck of cards of a strange game called Binary. Every card has a letter. The deck was formed by writing out a certain number in binary, spelling it out in English, and then making a card out of each character of the English word. For example, for the number 42, the binary representation is 101010, the English word is: one zero one zero one zero, and the deck consists of the following cards: 6 "o"s, three "n"s, six "e"s, three "z"s, and three "r"s. Given a shuffled version of the deck, recreate the largest number it could have correspnded to, and give your output in binary. Input The first line contains a single integer nn (1