Arseniy — young promising athlete. Everything that Arseniy likes to do — is to exercise and eat well. He is also punctual. He has just made a schedule of n items: for each of the next n hours, he has decided what he will do at that time — exercise or eat.
Arseniy showed the schedule to his coach, but he did not fully like it. The coach explained that exercising the next hour after eating is unhealthy.
Now Arseniy wants to change his schedule so that he never trains directly after eating. At the same time, he wants to change the minimum number of items on his schedule. Help Arseniy!
Input
The first line of the input contains the number n — number of items in Arseniy's schedule ( 1 ≤ n ≤ 10
5 ).
The second line contains Arseniy's original timetable. This is a string s of length n , consisting only of Latin letters « t » and « e », and if the letter « t », then this means that at the i-th hour Arseniy planned to train, and if this position is the letter « e », then this means that at the i-th hour Arseniy planned to eat.
Imprint
In the first line print the minimum number of schedule items to be changed.
In the second line print a string of n Latin letters « t » and « e » — modified schedule in the same format as in the input. If there are several suitable schedules, print any of them.
| # |
Input |
Output |
| 1 |
6
tttete |
1
ttteee |
| 2 |
5
tttte |
0
tttte |
| 3 |
9
eeeeetttt |
4
eeeeeeeee |