#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

vector<int>v[];

int dfn[],low[],ist[],belong[],id[],od[],sum,cnt;

stack<int>a;

inline void tarjan(int x){

      dfn[x]=low[x]=++cnt;

      a.push(x);

      ist[x]=;

      for(int i=;i<v[x].size();i++)

        if(!dfn[v[x][i]]){

          tarjan(v[x][i]);

          low[x]=min(low[x],low[v[x][i]]);

        }else if(ist[v[x][i]]){

          low[x]=min(low[x],dfn[v[x][i]]);

        }

      if(dfn[x]==low[x]){

          sum++;

          while(){

            int u=a.top();

            a.pop();

            ist[u]=;

            belong[u]=sum;

            if(u==x)break;

          }

      }

      return;

}

int main(){

      int n,m,i,j,k,ans=,ans2=,tot=;

      scanf("%d",&n);

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

          scanf("%d",&m);

          while(m){v[i].push_back(m);scanf("%d",&m);}

      }

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

        if(!dfn[i])tarjan(i);

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

        for(j=;j<v[i].size();j++)

          if(belong[i]!=belong[v[i][j]])

            id[belong[v[i][j]]]++,od[belong[i]]++;

      for(i=;i<=sum;i++){

        if(!id[i])ans++;

        if(!od[i])ans2++;

      }

      tot=max(ans,ans2);

      if(sum==)tot=;

      printf("%d\n%d\n",ans,tot);

      return ;

}