题目1450：产生冠军

#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
#include <string>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <map>
#include <functional>
#include <set>
using namespace std;
//1450
int n;
map<string , int> m;
string w,l;
int main(){
    //freopen("input.txt","r",stdin);
    while(cin>>n&&n){
        m.clear();
        while(n--){
            cin>>w>>l;
            m[l]=1;
            if(m.find(w)==m.end())
                m[w]=0;
        }
        int cnt=0;
        for(map<string,int>::iterator iter=m.begin(); iter!=m.end();++iter)
            if(m[iter->first]==0)
                cnt++;
        if(cnt>1)    cout<<"No"<<endl;
        else        cout<<"Yes"<<endl;
    }
    return 0;
}
/**************************************************************
    Problem: 1450
    User: cust123
    Language: C++
    Result: Accepted
    Time:30 ms
    Memory:1524 kb
****************************************************************/