#include <bits/stdc++.h>
using namespace std;
#define lc k << 1
#define rc k << 1 | 1
#define lcon lc, l, mid
#define rcon rc, mid + 1, r
#define Mid int mid = ((l + r) >> 1)
#define Init int k, int l, int r
#define mp(a, b) make_pair(a, b)
#define pii pair<int, int>
#define lb(x) (x & (-x))
#define FR for (int i = head[u], v = e[i].to; i; i = e[i].next, v = e[i].to)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define Tor(i, a, b) for (int i = a; i >= b; i--)
#define ll long long
#define gc() getchar()
template <class T>
inline void read(T &x)
{
    T flag = 1;
    x = 0;
    register char ch = gc();
    for (; !isdigit(ch); ch = gc())
        if (ch == '-')
            flag = -1;
    for (; isdigit(ch); ch = gc())
        x = (x << 1) + (x << 3) + (ch & 15);
    x *= flag;
    return;
}
template <class T>
inline void write(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    register T y = 1;
    int len = 1;
    for (; y <= x / 10; y *= 10)
        ++len;
    for (; len; --len, x %= y, y /= 10)
        putchar(x / y + 48);
}
#define _ (int)(5e5 + 5)
struct edge
{
    int next, to;
} e[_];
int cnt, n, top, cot, tim, read_edge_cnt;
int head[_], dfn[_], low[_], st[_], c[_], l_du[_], r_du[_];
int read_u[_], read_v[_];
void add(int f, int t)
{
    e[++cnt] = edge{head[f], t};
    head[f] = cnt;
}
void tarjin(int u)
{
    dfn[u] = low[u] = ++tim, st[++top] = u;
    FR if (!dfn[v])
        tarjin(v),
        low[u] = min(low[u], low[v]);
    else if (!c[u])
        low[u] = min(low[u], dfn[v]);
    if (dfn[u] == low[u])
    {
        ++cot;
        int v;
        do
            v = st[top--], c[v] = cot;
        while (v != u);
    }
}
int main()
{
    read(n);
    For(i, 1, n)
    {
        int x;
        read(x);
        while (x != 0)
        {
            add(i, x);
            ++read_edge_cnt;
            read_u[read_edge_cnt] = i;
            read_v[read_edge_cnt] = x;
            read(x);
        }
    }
    For(i, 1, n) if (!dfn[i]) tarjin(i);
    For(i, 1, read_edge_cnt)
    {
        int fu = c[read_u[i]], fv = c[read_v[i]];
        if (fu != fv)
            l_du[c[read_v[i]]]++, r_du[c[read_u[i]]]++;
    }
    int ansl = 0, ansr = 0;
    For(i, 1, cot) ansl += !l_du[i], ansr += !r_du[i];
    write(ansl);
    putchar(10);
    write(cot == 1 ? 0 : max(ansl, ansr));
    return 0;
}