3308: Poor_Chtholly

内存限制:128 MB 时间限制:1.000 S
评测方式:文本比较 命题人:
提交:302 解决:85

题目描述

Suffering from the erosion of preexistence, our poor Chtholly's memory is getting worse and worse. She resists forgetting her lover, her friends, neither the lovely children. Therefore, Chtholly decides to knit a scarf for each girl in the nursery. There are N days before her spirit fades away. Before that, everyday she will choose a lucky girl numbered A_i. Because of Chtholly's bad memory, she may chooses a girl who has already got a scarf. If the girl has already got a scarf, Chtholly will rest for a day, otherwise she will finish a new scarf and gift it to the girl.

输入

First line: one integer N (1 <= N <= 10,000), denotes the number of days.
Next N lines: one integer A_i (-1,000,000 <= A_i <= 1,000,000) each line, denotes the number of the girl Chtholly chooses on the i-th day.

输出

You're supposed to output N lines. On i-th line, if Chtholly knitted for girl A_i on the i-th day, output "Fairy A_i loves Chtholly" (without quotes), where A_i the number of the girl who got the scarf. Otherwise output "Don't forget the day D_i. Have a good dream" (without quotes), where D_i is the date when girl A_i got her scarf.
The dates are numbered from 1 to N.
Don't output extra spaces or newlines.

样例输入 复制

6
2
3
2
5
2
7

样例输出 复制

Fairy 2 loves Chtholly
Fairy 3 loves Chtholly
Don't forget the day 1. Have a good dream
Fairy 5 loves Chtholly
Don't forget the day 1. Have a good dream
Fairy 7 loves Chtholly

提示

Don't output extra spaces or newlines,that means output like printf("balabala %d balabala\n",answer);