#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n;
    cin >> n;
    scc_graph g(n);
    vector<vector<int>> f(n);
    dsu uf(n);
    rep(i,n) {
        int m;
        cin >> m;
        rep(j,m) {
            int b;
            cin >> b;
            --b;
            g.add_edge(i, b);
            f[i].push_back(b);
        }
    }
    int m = 0;
    map<int, int> l;
    for(auto  G : g.scc()) {
        for(int v : G) {
            uf.merge(v, G[0]);
        }
        l[uf.leader(G[0])] = m;
        m++;
    }
    vector<int> d(m);
    vector<vector<int>> G(m);
    rep(i,n) {
        for(int v : f[i]) {
            G[l[uf.leader(i)]].push_back(l[uf.leader(v)]);
        }   
    }
    rep(i,m) {
        sort(G[i].begin(),G[i].end());
        G[i].erase(unique(G[i].begin(),G[i].end()), G[i].end());
    }
    rep(i,m) {
        for(int v : G[i]) {
            d[v]++;
        }
    }
    if(m==1){
        cout<<"Yes"<<endl;
        return 0;
    }
    queue<int> q;
    rep(i,m) {
        if(d[i]==0) q.push(i);
    }
    while(!q.empty()) {
        if(q.size()>=2){
            cout<<"No"<< endl;
            return 0;
        }
        int u = q.front();q.pop();
        m--;
        for(int v : G[u]) {
            d[v]--;
            if(d[v]==0) q.push(v);
        }
    }
    dbg(m);
    if(m==0){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }
    return 0;
}