#include <stdio.h>

 #include <algorithm>

 #include <string.h>

 #include <iostream>

 #include <string>

 #include <vector>

 #include <map>

 using namespace std;

 const int N =  + ;

 int n;

 map<string,int> M;

 vector<int> G[N];

 int tot = ;

 int dp[N][];

 void dfs(int u)

 {

     dp[u][] = ;

     dp[u][] = ;

     for(int i=;i<G[u].size();i++)

     {

         int v = G[u][i];

         dfs(v);

         dp[u][] += max(dp[v][], dp[v][]);

         dp[u][] += dp[v][];

     }

 }

 int main()

 {

     while(scanf("%d",&n) ==  && n)

     {

         for(int i=;i<=n;i++) G[i].clear();

         tot = ;

         M.clear();

         string boss;

         cin >> boss;

         M[boss] = ++tot;

         for(int i=;i<n;i++)

         {

             string a,b;

             cin >> a >> b;

             if(M[a] == ) M[a] = ++tot;

             if(M[b] == ) M[b] = ++tot;

             int u = M[a], v = M[b];

             G[v].push_back(u);

         }

         dfs();

         printf("%d ",max(dp[][], dp[][]));

         int flag = dp[][] != dp[][];

         for(int i=;i<=n&&flag;i++)

         {

             if(dp[i][] < dp[i][]) continue;

             for(int j=;j<G[i].size()&&flag;j++)

             {

                 int v = G[i][j];

                 if(dp[v][] == dp[v][])

                 {

                     flag = ;

                     break;

                 }

             }

         }

         puts(flag ? "Yes" : "No");

     }

     return ;

 }