Lucía is organizing two very important competitions: the Argentinian Programming Tournament (TAP in Spanish) and the University Pasapalabra Tournament (TUP in Spanish). These tournaments are held simultaneously at multiple venues.
To decorate these venues, Lucía bought triangular paper banners with letters, like the ones shown in the following image:
Lucía realized that she can rearrange the banners to form different words. Once arranged, she plans to combine some banners to create garlands, which will be sent to the various venues. All these garlands must have exactly three banners, either forming the word "TAP" or the word "TUP". If a garland does not meet these criteria, then it cannot be sent to the venues. Below is an example of how she can do this with the previous banners:
What is the maximum number of garlands that she can send to the venues?
A line with a string $$$S$$$ $$$(3 \leq |S| \leq 300)$$$, the letters of Lucía's banners.
The notation $$$|S|$$$ denotes the number of letters in $$$S$$$.
It is guaranteed that all its characters are uppercase letters of the English alphabet.
A line with an integer, the maximum number of garlands that can be sent.
APPUNTATTE
2
TULIPAN
1
TAPTUPTAP
3
TOP
0
The images in the statement correspond to the first example.
In the second example, she can arrange them like this: TUPNILA.
