def whose_message(a):
if a[:5]=='miao.' and a[-5:]!='lala.':
return "Rainbow's"
if a[:5] != 'miao.' and a[-5:] == 'lala.':
return "Freda's"
return "OMG>.< I don't know!"
t=int(input())
for i in range(t):
m=input()
print(whose_message(m))
#include<bits/stdc++.h>
using namespace std;
string whoSaidIt(string s) {
bool freda = false;
bool rainbow = false;
string itFreda = "Freda's", itRainbow = "Rainbow's", donnu = "OMG>.< I don't know!";
string lala = "lala." , meow = "miao.";
int index = 0, n = (int) s.size();
while (index < min(5, (int)s.size())) {
if (meow[index] != s[index])
break;
index ++;
}
if (index == 5)
rainbow = true;
index = 0;
while (index < 5 && n - 5 + index >= 0) {
if (lala[index] != s[n - 5 + index])
break;
index ++;
}
if (index == 5)
freda = true;
if (freda == rainbow)
return donnu;
if (freda)
return itFreda;
if (rainbow)
return itRainbow;
}
int main() {
int n;
string s;
cin >> n;
getline(cin, s);
while(n--) {
getline(cin, s);
cout << whoSaidIt(s) << endl;
}
}
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |