#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define rep2ll(i,m,n) for(ll (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using mint = atcoder::modint998244353;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VM = vector<mint>;
using VVM = vector<VM>;
using VVVM = vector<VVM>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n; cin>>n;
    VL m(n);
    VVL a(n);
    rep(i,n){
        cin>>m[i];
        a[i] = VL(m[i]);
        rep(j,m[i]) cin>>a[i][j], a[i][j]--;
    }
    atcoder::scc_graph g(n);
    rep(i,n) for(auto j:a[i]) g.add_edge(i, j);
    auto scc = g.scc();
    bool b1 = false;
    for(auto x:scc[0]) b1 |= x == 0;
    bool b2 = true;
    int sz = scc.size();
    VL b(n);
    rep(i,sz){
        for(auto x:scc[i]) b[x] = i;
    }
    VL c(sz-1, 0);
    rep(i,n){
        for(auto j:a[i]){
            if(b[i] + 1 == b[j]){
                c[b[i]] = 1;
            }
        }
    }
    rep(i,sz-1) b2 &= c[i];
    cout<<(b1&&b2?"Yes\n":"No\n");




    
    return 0;
}