Vedant really wants the recruiters at a certain internet search company to know how much he wants to work there, so he adds a bunch of cute hearts at the end of his resume.
A cute heart is defined as one of the following:
<3is a cute heart
xis a cute heart
yare cute hearts
<<<<3<33<333 are all cute hearts, but
3<3< are not cute hearts.
Help Vedant figure out whether the text he added to his resume is a cute heart!
The input is a single string with no more than \(10^5\) characters, with each character being
<3 if the text is a cute heart, and
Sample Input 1
Sample Output 1
Explanation for Sample Input 1
All the hearts are nested correctly within each other.
Sample Input 2
Sample Output 2
Explanation for Sample Input 2
The last character,
3, is not matched with a
<, so it can’t be a cute heart.