1 /*************************
  2 User：Mandy.H.Y
  3 Language:c++
  4 Problem:luogu2746
  5 Algorithm:
  6 Date:2019.8.28 
  7 *************************/
  8 
  9 #include<bits/stdc++.h>
 10 #define Max(x,y) ((x) > (y) ? (x) : (y))
 11 #define Min(x,y) ((x) < (y) ? (x) : (y))
 12 
 13 using namespace std;
 14 
 15 const int maxn = 105;
 16 
 17 int first[maxn],size,n,tot,tp,cnt;
 18 int dfn[maxn],low[maxn],vis[maxn],s[maxn],ind[maxn],outd[maxn];
 19 int father[maxn];
 20 
 21 struct Edge{
 22     int v,nt,u;
 23 }edge[10005];
 24 
 25 template<class T>inline void read(T &x){
 26     x = 0;bool flag = 0;char ch = getchar();
 27     while(! isdigit(ch)) flag |= ch == ‘-‘,ch = getchar();
 28     while(isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48),ch = getchar();
 29     if(flag) x = -x;
 30 } 
 31 
 32 template<class T>void putch(const T x){
 33     if(x > 9) putch(x / 10);
 34     putchar(x % 10 | 48);
 35 }
 36 
 37 template<class T>void put(const T x){
 38     if(x < 0) putchar(‘-‘),putch(-x);
 39     else putch(x);
 40 }
 41 
 42 void file(){
 43     freopen("2746.in","r",stdin);
 44     freopen("2746.out","w",stdout);
 45 }
 46 
 47 void eadd(int u,int v){
 48     edge[++size].v = v;
 49     edge[size].u = u;
 50     edge[size].nt = first[u];
 51     first[u] = size;
 52 }
 53 
 54 void readdata(){
 55     read(n);
 56     for(int i = 1;i <= n; ++ i){
 57         int v;read(v);
 58         while(v){
 59             eadd(i,v);
 60             read(v);
 61         }
 62     }
 63 }
 64 
 65 void tarjan(int u){
 66     dfn[u] = low[u] = ++tot;
 67     vis[u] = 1;
 68     s[tp++] = u;
 69     
 70     for(int i = first[u];i;i = edge[i].nt){
 71         int v = edge[i].v;
 72         if(!dfn[v]){
 73             tarjan(v);
 74             low[u] = min(low[v],low[u]);
 75         } else if(vis[v]) low[u] = min(low[u],dfn[v]);
 76     }
 77     
 78     if(dfn[u] == low[u]){
 79         int x;++cnt;
 80         do{
 81             x = s[tp - 1];
 82             tp--;
 83             father[x] = cnt;
 84             vis[x] = 0;
 85         }while(x != u);
 86     }
 87 }
 88 
 89 void work(){
 90     for(int i = 1;i <= n; ++ i){
 91         if(!dfn[i]) tarjan(i);
 92     } 
 93     
 94     for(int i = 1;i <= size; ++ i){
 95         int u = edge[i].u;
 96         int v = edge[i].v;
 97         if(father[u] != father[v]){
 98             ind[father[v]]++;
 99             outd[father[u]]++;
100         }
101     }
102     
103     int cntin = 0,cntout = 0;
104     
105     for(int i = 1;i <= cnt; ++ i){
106         if(!ind[i]) cntin++;
107         if(!outd[i]) cntout++;
108     }
109     if(cnt == 1){
110         puts("1");
111         puts("0");
112         return;
113     }
114     put(cntin);
115     putchar(‘\n‘);
116     put(Max(cntin,cntout));
117 }
118 
119 int main(){
120 //    file();
121     readdata();
122     work();
123     return 0;
124 }