#include <bits/stdc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e5+5;
vector<pair<int,int>> adj[N]; //u -> {v,0/1/2} => 0->blue, 1->red, 2-> magenta
int dis[N][2], can[N][2], cnt = 0, ok = 0, hunter;
bool blue,red;
int a,b, len;
void dfs(int u, int c, int par){
for(auto [v,cc] : adj[u]){
if(v==par) continue;
if(v==b) len = dis[u][c] + 1;
if(cc==(c^1)) continue;
dis[v][c] = dis[u][c]+1;
dfs(v,c,u);
}
}
void dfs2(int u, int par){
for(auto [v,cc] : adj[u]){
if(v==par||cc==hunter||(dis[v][hunter]!=-1&&dis[v][hunter] <= dis[v][hunter^1])) continue;
if(dis[u][hunter]==-1&&dis[v][hunter]==-1) ok = 1;
dfs2(v,u);
}
}
signed main(){
fastio
map<string,int> get;
get["plava"] = 0;
get["crvena"] = 1;
get["magenta"] = 2;
int n;
cin >> n;
cin >> a >> b;
for(int i = 1;i < n;i++){
int u,v; string s;
cin >> u >> v >> s;
adj[u].push_back({v,get[s]});
adj[v].push_back({u,get[s]});
if(get[s]!=1&&((u==a&&v!=b)||(u!=b&&v==a))) blue = 1;
if(get[s]!=0&&(u==b||v==b)) red = 1;
}
if(!blue){
cout << "Marin\n";
return 0;
}else if(!red){
cout << "Paula\n";
return 0;
}
fill(&dis[0][0],&dis[N-1][1],-1);
dis[a][0] = 0;
dfs(a,0,-1);
dis[b][1] = 0;
dfs(b,1,-1);
if(len&1^1) hunter = 0; else hunter = 1;
dfs2((hunter ? a : b),-1);
if(!ok){
cout << (hunter==0 ? "Paula" : "Marin") << "\n";
}else{
cout << "Magenta\n";
}
}