A long long time ago, the dragon suddenly appeared and took the princess. The is disappeared. The kingdom is dangerous. Who is the bravest in the world? A brave man came and shouted, "I will take my best sword, climb the highest mountain, enter the deepest forest, and bring the princess back to me."
The king was very pleased and asked him his name. The young man thought for a moment, and he said, "Sire, my name is Darabun, Bandbedib Dobiluon." The hero Darabun, mounted the fastest horse, rode out from the castle with the hope of all, defeated the monster, won twelve gold coins and witnessed his progress with countless wounds.
On the other side, the dragon imprisoned the princess and disappeared again. The princess wanted to escape, but the place where the princess was imprisoned was guarded by five monsters. The monster told the princess that as long as she solved the problem of five monsters, the princess could leave. "What's one plus one?" asked the first monster. The second monster asked, how much is two plus two? The third asked, what's three plus three? The fourth monster asked, what's four plus four? The princess was very clever and solved the problem of the first four monsters at once.
It was the last monster's turn. The monster gave the princess $T$ positive integers and asked the maximum number of different integers that each positive integer can be split into. The princess is in trouble. Come and help the princess.
