#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

int main()
{
  int n, m;
  cin >> n;
  vector<vector<int>> g(n), gr(n);
  for (int i = 0; i < n; ++i)
  {
    int m;
    cin >> m;
    for (int j = 0; j < m; ++j)
    {
      int v;
      cin >> v;
      --v;
      g[i].push_back(v);
      gr[v].push_back(i);
    }
  }
  vector<int> check(n), topo;
  auto topologicalsort = [&](auto f, int now) -> void
  {
    if (check[now]) return;
    check[now] = 1;
    for (auto v : g[now]) f(f, v);
    topo.push_back(now);
  };
  for (int i = 0; i < n; ++i) topologicalsort(topologicalsort, i);
  reverse(topo.begin(), topo.end());
  vector<int> tmp;
  auto dfs = [&](auto f, int now) -> void
  {
    if (check[now] == 0) return;
    tmp.push_back(now);
    check[now] = 0;
    for (int v : gr[now]) f(f, v);
  };
  vector<int> newid(n);
  int cnt = 0;
  for (int v : topo)
  {
    if (check[v] == 0) continue;
    tmp.clear();
    dfs(dfs, v);
    for (auto v1 : tmp) newid[v1] = cnt;
    ++cnt;
  }
  set<pair<int, int>> st;
  vector<vector<int>> ng(cnt);
  for (int i = 0; i < n; ++i)
  {
    for (auto v : g[i])
    {
      if (newid[i] == newid[v] || st.find({newid[i], newid[v]}) != st.end()) continue;
      st.insert({newid[i], newid[v]});
      int a = newid[i], b = newid[v];
      ng[a].push_back(b);
    }
  }
  check.assign(n, 0);
  topo.clear();
  g = ng;
  for (int i = 0; i < cnt; ++i)
  {
    topologicalsort(topologicalsort, i);
  }
  reverse(topo.begin(), topo.end());
  for (int i = 0; i < topo.size() - 1; ++i)
  {
    int np = topo[i + 1];
    bool flag = true;
    for (int v : ng[topo[i]])
    {
      if (v == np)
      {
        flag = false;
        break;
      }
    }
    if (flag)
    {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}