Background

没有就连带上面的Background大标题一起删除。

Description

One day Liu Yuxin saw Song Junyang's despicable deeds, and then she felt angry and sad because she was used.

Liu Yuxin's mood could not calm down for a long time. She felt that only the Oreo and the PrettyGril could bring her happiness and revive her.

At that time, Wisdom Brother Hui gave Liu Yuxin great encouragement and support, and gave her another way out.

So now, what Liu Yuxin needs has become the PrettyGril, Oreo, and GayFriend.

And now, God come out, God says that I have $N$($0<=N<=1000$)sets here, you can choose. Every set has its value $v$($0<=v<=100000$) and what it contains (PrettyGril, Oreo, and GayFriend). The contents are displayed through a string $s$($0<s.length()<=60$). Now, please help Liu Yuxin to find the minimum price of getting PrettyGril, Oreo, and GayFriend at the same time. If you could not get these three things at the same time, please output "Where are you? My beloved.".

Format

Input

The first line is an integer $n$. Then following $n$ lines, each line contains one integer $v_i$ and a string ​$s_i$.

Output

The minimum price of getting PrettyGril, Oreo, and GayFriend at the same time. Or a string —— "Where are you? My beloved.".

Samples

1
5 GayFriendGayFriendGayFriend
2
1 GayFriend
2 PrettyGrilOreo

Where are you? My beloved.
3