#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int n;
map<int, vector<int>> arr;
int test(int start) {
vector<bool> visited(n, false);
vector<vector<int>> levels = {{start}};
size_t lvl = 0; // Changed int to size_t
size_t pos = 0; // Changed int to size_t
int salary = 0;
visited[start] = true;
while (lvl < levels.size()) {
start = levels[lvl][pos];
auto it = arr.find(start);
if (it != arr.end()) {
for (int i: arr[start]) {
if (!visited[i]) {
visited[i] = true;
if (levels.size() > lvl + 1) {
levels[lvl + 1].push_back(i);
} else {
levels.push_back({i});
}
}
}
}
pos++;
if (pos == levels[lvl].size()) {
salary += levels[lvl].size() * (lvl + 1);
lvl++;
pos = 0;
}
}
// Return the minimum value possible if not all nodes were visited
if (find(visited.begin(), visited.end(), false) != visited.end()) {
return salary;
}
return 2147483646;
}
int main() {
int salary = 2147483646;
cin >> n;
for (int i = 0; i < n; i++) {
int len;
cin >> len;
vector<int> temp;
for (int j = 0; j < len; j++) {
int x;
cin >> x;
x--;
if (arr.find(x) == arr.end()) {
arr[x] = {i};
} else {
arr[x].push_back(i);
}
}
}
for (int i = 0; i < n; i++) {
if (arr.find(i) != arr.end()) {
int temp = test(i);
if (temp < salary) { // Fixed comparison to find minimum salary
salary = temp;
}
}
}
cout << salary;
}
