#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;
const int N = 100000 + 5;
int pre[N << 1];

void Init(){
    for(int i = 0; i < N * 2; i++) pre[i] = i;
}

int Find(int x){
    return pre[x] == x ? x : (pre[x] = Find(pre[x]));
}

void Merge(int x, int y){
    x = Find(x), y = Find(y);
    if(x != y) pre[y] = x;
}

int Good(int x){
    return x;
}

int Bad(int x){
    return N + x;
}

bool Same(int x, int y){
    return Find(x) == Find(y);
}

int main(){
    int n, x, p;
    scanf("%d", &n);
    Init();
    for(int i = 1; i <= n; i++){
        scanf("%d %d", &x, &p);
        if(p == 1){
            Merge(Good(i), Good(x));
            Merge(Bad(i), Bad(x));
        }else{
            Merge(Good(i), Bad(x));
            Merge(Bad(i), Good(x));
        }
    }
    for(int i = 1; i <= n; i++){
        if(Same(Good(i), Bad(i))){
            printf("One face meng bi\n");
            return 0;
        }
    }
    printf("Time to show my power\n");
    return 0;
}